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 Ruby (judge verdict: Time Limit Exceeded)

n, q = gets.split.map(&:to_i)
a = gets.split.map(&:to_i)
b = a.clone
sum = 0;
n.times{|i|
  sum += a[i]
  if a[i] >= q then
    puts 1
    exit
  end
}
puts 0 if sum < q

1.upto(n){|i|
  0.upto(n-1-i){|j|
    b[j] += a[j+i]
    if b[j] >= q then
      puts i+1
      exit
    end
  }
}