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.

Examples

Input

6 4 1 2 1 2 3 2

Output

2

Input

6 6 1 2 1 2 3 2

Output

3

Input

3 7 1 2 3

Output

0

inputFormat

Input

The input is given in the following format.

$N$ $S$ $a_1$ $a_2$ ... $a_N$

outputFormat

Output

Print the smallest sub-array size in a line.

Examples

Input

6 4 1 2 1 2 3 2

Output

2

Input

6 6 1 2 1 2 3 2

Output

3

Input

3 7 1 2 3

Output

0

样例

6 4
1 2 1 2 3 2

2