La2678

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>

using namespace std;

#define INF 0x7f7f7f7f
#define MAXN (100000+5)

int read[MAXN], pre[MAXN];

int main(){
int n, s;

while(scanf("%d%d", &n, &s) != EOF){
pre[0] = 0;
for(int i = 1; i <= n; i++){
scanf("%d", &read[i]);
pre[i] = pre[i-1]+read[i];
}

int i = 1, ans = INF;
for(int j = 1; j <= n; j++){
if(pre[i-1] > pre[j]-s) continue;
while(pre[i] <= pre[j]-s) i++;
ans = min(ans, j-i+1);
}
if(ans != INF) printf("%d\n", ans);
else printf("0\n");
}

return 0;
}