Given an array of Integers and a value s.

Can you find a subarray of which the sum of all the elements is greater than the given sum (s)? That is (a_i + a_i+1 ......a_k ) >= s.

Out of all the subarrays of which the sum >= s, find the one having minimum length.

INPUT:

The first line contains one integer t(1 ≤ t ≤ 20) — the number of test cases. The description of the test cases follows.

The first line of each test case contains two integers n(1 ≤ n ≤ 10⁵) and s (1 ≤ s ≤ 10⁹ )  — the size of the array and given sum.

The second line contains n integers a_i  (1 ≤ a_i ≤ 10⁴)— the value of the i^th element.

30% test cases -- (1 ≤ n ≤ 10³ )

OUTPUT:

For each test case, print the Minimum length of the subarray, if it doesn't exist print 0.