#include <iostream>
#include <queue>

using namespace std;

int main()
{
    int n, p, s = 0, m = 100001, a, i;
    queue<int>q;
    cin >> n >> p;
    for(i=0; i<n; i++)
    {
        cin >> a;
        s+=a;
        q.push(a);
        while(s > p)
        {
            if(q.size()<m)m=q.size();
            a = q.front();
            q.pop();
            s -= a;
        }
    }
    if(q.size()<m)m=q.size();
    cout << m;
    return 0;
}