#include <bits/stdc++.h>

using namespace std;
int n,p,a[100001],m=INT_MAX;

int main()
{
    ifstream f("be.in");
    //f>>n>>p;
    cin>>n>>p;
    for (int i=1; i<=n; i++) {
        //f>>a[i];
        cin>>a[i];
    }
    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;
}