#include <iostream>
#include <queue>
#include <fstream>
using namespace std;

int main()
{
    //ifstream cin("in.txt");
    queue <long long int> pieces;
    long long int n, p;
    cin>>n>>p;
    long long int x;
    long long int s=0;
    long long int minl=100000;
    for(int i = 1; i<=n; i++)
    {
        cin>>x;
        s+=x;
        pieces.push(x);
        if(s>=p)
        {
            while(s-pieces.front() > p && !pieces.empty())
            {
                s-=pieces.front();
                pieces.pop();
            }
            if(pieces.size() < minl)
            {
                //cout<<pieces.size()<<"\n";
                minl = pieces.size();
            }
        }
    }
    cout<<minl;
    return 0;
}