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: Accepted)

n, s = gets.chomp.split.map(&:to_i)
arr = gets.chomp.split.map(&:to_i)
l = r = sum = 0
li = ri = -1
min = nil
while true
    sum += r
    sum -= l
    if sum >= s
        min = ri - li if min.nil? || min > ri - li
        li += 1
        break if li == ri
        l, r = arr[li], 0
    else
        ri += 1
        break if ri == n
        l, r = 0, arr[ri]
    end
end
puts (min.nil? ? 0 : min)