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: Wrong Answer)

n, q = gets.split.map(&:to_i)
a = gets.split.map(&:to_i)
ans = n+1
sum = 0
l = 0
r = 0
while l < n
  if l == r then
    sum = a[r]
    r += 1
  else
    if sum >= q then
      sum -= a[l]
      l += 1
    elsif r < n then
      sum += a[r]
      r += 1
    else
      break
    end
    ans = r - l if sum >= q && ans > r - l 
  end
end
if ans <= n
  puts ans
else
  puts 0
end