#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<ll> vll;
typedef set<ll> sll;
typedef queue<ll> qll;
typedef priority_queue<ll> pqll;
typedef vector<vll> v2ll;
typedef map<ll,ll> mll;
typedef vector<pll> vpll;
#define fs first
#define sc second
#define pb push_back

const ll MOD = 1e9+7;

void solve()
{
    ll n, p;
    cin >> n >> p;
    vll v(n);
    ll ans = 1e10;
    ll start = 0;
    ll csum = 0;
    for(ll i = 0; i < n; i++)
    {
        cin >> v[i];
        csum += v[i];
        while(start <= i && csum >= p)
        {
            ans = min(ans, i-start+1);
            csum -= v[start];
            start++;
        }
    }
    cout << ans << "\n";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    ll t = 1;
    //cin >> t;
    while(t--)
        solve();
    return 0;
}