#include <bits/stdc++.h>

using namespace std;
int n,p,m;

struct szamok{
    int penz=0;
    int m=0;
}a[100001];

int main()
{
    ifstream f("be.in");
    //f>>n>>p;
    cin>>n>>p;
    int s=0,i=0;
    while (a[i].m<p) {
        i++;
        f>>a[i].penz;
        a[i].m=a[i-1].m+a[i].penz;
        m++;
    }
    //cout<<m<<endl;
    while (i<n) {
        i++;
        //f>>a[i].penz;
        cin>>a[i].penz;
        a[i].m=a[i-1].m+a[i].penz;
        if ((a[i].m-a[i-m+1].m)>=p)m--;
    }
    /*for (int i=1; i<=n; i++) {
        //cout<<a[i].penz<<"-"<<a[i].m<<endl;
    }*/
    /*for (int i=1; i<=n; i++) {
        int s=a[i],j=i,t=1;
        //cout<<i<<":"<<s<<" ";
        while (s<p && j<n) {
            j++;
            s=s+a[j];
            //cout<<s<<" ";
            t++;
        }
        //cout<<endl;
        if (t<m && s>=p) m=t;
    }*/
    cout<<m;
    return 0;
}