#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
const int N=3e5+7;
ll T = 1, a[N], b[N];
void solve()
{
ll n, m;
cin >> n >> m;
for(int i = 1; i <= n; i++)
cin >> a[i];
int mn = n + 1, l = 1;
ll sum = 0;
for(int r = 1; r <= n; r++){
sum += a[r];
while(l <= r && sum - a[l] >= m)
sum -= a[l], l++;
if(sum >= m)
mn = min(mn, r - l + 1);
}
if(mn == n + 1)
mn = -1;
cout << mn;
}
int main()
{
ios::sync_with_stdio(NULL);
cin.tie(0);
cout.tie(0);
// freopen("","r", stdin);
// freopen("","w", stdout);
// cin>>T;
while(T--)
solve();
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKI2RlZmluZSBsbCBsb25nIGxvbmcKI2RlZmluZSBwYiBwdXNoX2JhY2sKI2RlZmluZSB5ZXMgY291dDw8IllFU1xuIjsKI2RlZmluZSBubyBjb3V0PDwiTk9cbiI7CmNvbnN0IGludCBOPTNlNSs3OwpsbCBUID0gMSwgYVtOXSwgYltOXTsKdm9pZCBzb2x2ZSgpCnsKICAgIGxsIG4sIG07CgogICAgY2luID4+IG4gPj4gbTsKCiAgICBmb3IoaW50IGkgPSAxOyBpIDw9IG47IGkrKykKICAgICAgICBjaW4gPj4gYVtpXTsKCiAgICBpbnQgbW4gPSBuICsgMSwgbCA9IDE7CiAgICBsbCBzdW0gPSAwOwoKICAgIGZvcihpbnQgciA9IDE7IHIgPD0gbjsgcisrKXsKICAgICAgICBzdW0gKz0gYVtyXTsKCiAgICAgICAgd2hpbGUobCA8PSByICYmIHN1bSAtIGFbbF0gPj0gbSkKICAgICAgICAgICAgc3VtIC09IGFbbF0sIGwrKzsKCiAgICAgICAgaWYoc3VtID49IG0pCiAgICAgICAgbW4gPSBtaW4obW4sIHIgLSBsICsgMSk7CiAgICB9CgogICAgaWYobW4gPT0gbiArIDEpCiAgICAgICAgbW4gPSAtMTsKCiAgICBjb3V0IDw8IG1uOwp9CmludCBtYWluKCkKewogICAgaW9zOjpzeW5jX3dpdGhfc3RkaW8oTlVMTCk7CiAgICBjaW4udGllKDApOwogICAgY291dC50aWUoMCk7CgovLyAgICBmcmVvcGVuKCIiLCJyIiwgc3RkaW4pOwovLyAgICBmcmVvcGVuKCIiLCJ3Iiwgc3Rkb3V0KTsKLy8gICAgY2luPj5UOwogICAgd2hpbGUoVC0tKQogICAgICAgIHNvbHZlKCk7CiAgICByZXR1cm4gMDsKfQo=