#include <bits/stdc++.h>
#define ll long long
#define int long long
using namespace std;
const int maxn = 1e6+7;
ll n,k,ans=LLONG_MIN,pre[maxn];
int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    freopen("NGHENHAC.INP","r",stdin);
    freopen("NGHENHAC.OUT","w",stdout);
    
    cin >> n >> k;
    for (int i=1;i<=n;i++)
    {
        ll x; cin >> x;
        pre[i] = pre[i-1] + x;
    }

    ll l=1;
    for (int r=1;r<=n;r++)
    {
        ll sum = pre[r] - pre[l-1];
        while (sum > k && l<r)
        {
            sum -= pre[l];
            l++;
        }
        ans = max(ans,r-l+1);
    }
    cout << ans;
}
