/*
 _____ _             _              _           _
|_   _| |__   ___   / \   _ __  ___| |__  _   _| |
  | | | '_ \ / _ \ / _ \ | '_ \/ __| '_ \| | | | |
  | | | | | |  __// ___ \| | | \__ \ | | | |_| | |
  |_| |_| |_|\___/_/   \_\_| |_|___/_| |_|\__,_|_|

*/
#include<bits/stdc++.h>
#define ll          long long
#define pb          push_back
#define ppb         pop_back
#define    endl        '\n'
#define mii         map<ll int,ll int>
#define msi         map<string,ll int>
#define mis         map<ll int, string>
#define rep(i,a,b)    for(ll int i=a;i<b;i++)
#define mpi         map<pair<ll int,ll int>,ll int>
#define pii         pair<ll int,ll int>
#define vi          vector<ll int>
#define vii         vector<pair<ll int, ll int>>
#define vs          vector<string>
#define all(a)      (a).begin(),(a).end()
#define F           first
#define S           second
#define sz(x)       (ll int)x.size()
#define hell        1000000007
#define lbnd        lower_bound
#define ubnd        upper_bound
#define bs          binary_search
#define mp          make_pair
#define what_is(x)  cerr << #x << " is " << x << endl;
#define time        cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
using namespace std;
#define PI 3.141592653589793
#define N  100005
ll n,k;
vi a;
ll v[N];

// bool check(ll vl)
// {
//     rep(i,vl,n+1)
//     {
//         ll sum=0;
//         rep(j,i-vl+1,i+1)
//         sum+=v[j];
//         if(sum<=k)
//             return 0;
//     }
//     return 1;
// }

void solve()
{
    cin>>n>>k;
    rep(i,0,n)
    {
        ll x;
        cin>>x;
        a.pb(x);
        v[i+1]=x;
    }
    // rep(i,1,n+1)
    //     v[i]+=v[i-1];
    rep(vl,1,n+1)
    {
        bool f=1;
        rep(i,vl,n+1)
        {
            ll sum=0;
            rep(j,i-vl+1,i+1)
            sum+=v[j];
            if(sum<=k)
            {
                f=0;
                break;
            }
        }
        if(f)
        {
            cout<<vl;
            exit(0);
        }
    }

    // assert(n>=1 && n<=100000);
    // assert(k>=1 && k<=1000000000);
    // rep(i,0,n)
    //     assert(a[i]>=1 && a[i]<=1000000000);
    // assert(sz(a)==n);

    // if(r==n)
        cout<<-1;
    // else
    //     cout<<r+1;
    return;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int TESTS=1;
//    cin>>TESTS;
    while(TESTS--)
    {
        solve();
    }
    time
    return 0;
}