Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

The Smallest Window I

For a given array $a_1, a_2, a_3, ... , a_N$ of $N$ elements and an integer $S$, find the smallest sub-array size (smallest window length) where the sum of the sub-array is greater than or equal to $S$. If there is not such sub-array, report 0.

Constraints

$1 \leq N \leq 10^5$

$1 \leq S \leq 10^9$

$1 \leq a_i \leq 10^4$

Input

The input is given in the following format.

$N$ $S$

$a_1$ $a_2$ ... $a_N$

Output

Print the smallest sub-array size in a line.

Sample Input 1

6 4
1 2 1 2 3 2

Sample Output 1

2

Sample Input 2

6 6
1 2 1 2 3 2

Sample Output 2

3

Sample Input 3

3 7
1 2 3

Sample Output 3

0

Solution in C (judge verdict: Time Limit Exceeded)

#include<stdio.h>
#define MAX 100001


int main(){
int n,S,i,j;
int sum=0;
int A[MAX];
int X[MAX];
int L=-1;

scanf("%d %d",&n,&S);
for(i=1;i<=n;i++){
 scanf("%d",&A[i]);
 sum+=A[i];
 X[i]=A[i];
 if(A[i]==S)L=1;
}


if(sum==S){L=n;}
else if(sum<S){L=0;}
else if(L!=1){

 for(i=1;i<n;i++){/*iは幅*/

  for(j=1;j<=n-i;j++){
   X[j]=X[j]+A[j+i];
   if(X[j]>=S){L=i+1;break;}
  }

  if(X[j]>=S)break;

 }

}


printf("%d\n",L);

return 0;
}