Shortest Subsequence With Sum at Least X

You are given an integer sequence $A_1, A_2, \dots, A_N$ of length $N$ and an integer $X$.

Consider the subsequences of consecutive elements $A_i, A_{i+1}, \dots, A_j$ ($1 \le i \le j \le N$) whose elements sum to $X$ or more. Write a program that finds the length of the shortest such subsequence. A subsequence holds at least one element.

The first line contains the number of test cases $T$.

The first line of each test case contains $N$ ($1 \le N \le 500{,}000$) and $X$ ($-10^9 \le X \le 10^9$). The second line contains the $N$ elements of the sequence, separated by spaces. Each element is an integer between $-10^9$ and $10^9$.

For each test case, print on one line the shortest length among the subsequences of consecutive elements whose sum is $X$ or more. If there is no such subsequence, print $-1$.