#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
int main() {
int N, S;
while (scanf("%d %d", &N, &S) != EOF) {
int sumArray[N];
int sum = 0;
int min = N+1;
for (int n=0; n<N; n++) {
int temp;
scanf("%d", &temp);
sum += temp;
sumArray[n] = sum;
}
for (int i=N-1; i>=0; i--) {
for (int ii = i-1; ii>=0; ii--) {
if (sumArray[i]-sumArray[ii] >= S){
int length = i-ii;
if (length < min)
min = length;
}
}
}
if (min == N+1) printf("0");
else printf("%d\n", min);
}
return 0;
}