#include <bits/stdc++.h>
using namespace std;
#define f(i,k,n) for(int i=k; i<n; i++)
#define ll long long
const int inf = INT_MAX;

void solve()
{
    int n,m;
    cin>>n>>m;
    int p[n+1];
    p[0]=0;
    int x;
    cin>>x;
    p[1]=x;
    f(i,2,n+1)
    {
        cin>>x;
        p[i]=p[i-1]+x;
    }
    if(p[n]<=m)
    {
        cout<<n;
        return;
    }
    vector<int> a;
    int kezd=0, veg=1;

    while(kezd<=veg && veg<n+1)
    {
        if(p[veg]-p[kezd]<=m)
        {
            a.push_back(veg-kezd);
            veg++;
        }
        else
        {
            kezd++;
        }
    }
    int maxi=0;
    for(auto q: a) if(maxi<q)   maxi=q;
    cout<<maxi;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    //cin>>t;
    while(t--)  solve();
    return 0;
}