You are given an array \(A\) of length \(N\) sorted in non-decreasing order and an integer \(X\). Find the number of subarrays such that the sum of the minimum and maximum element of that subarray is less than or equal to \(X\).

Input Format:

• The first line contains an integer \(T\), which denotes the number of test cases.
• The first line of each test case contains two integers, \(N\) and \(X\).
• The next line of each test case contains \(N\) space-separated integers, elements of array \(A\).

Output Format:

For each test case, print the number of subarrays such that the sum of the minimum and maximum element of that subarray is less than or equal to \(X\).

Constraints:

\(1 \leq T \leq 10 \\ 1 \leq N \leq 10^5 \\ 1 \leq A[i], X \leq 10^5\)