You are given two integers N, K, and an array X of N elements.

Write a program to find the sum of the lengths of the sub-arrays with K as its maximum number.

Any two sub-arrays that are considered should not overlap each other.

Find the maximum possible sum.

Note:

1. A subarray is a slice from a contiguous array (i.e., occupy consecutive positions) and inherently maintains the order of elements. For example, the subarrays of array {1, 2, 3} are {1} , {1, 2} , {1, 2, 3} , {2} , {2, 3} , and {3}.
2. Use 1-based indexing.

Example

Assumption

• T = 1
• N = 3
• K = 4
• X = {2, 1, 3}

Approach

There is no K=4 in the array X.

Therefore, the answer is 0.

Function description

Complete the solve function provided in the editor. This function takes the following three parameters and returns the answer.

• N: Represents an integer denoting the size of array B.
• K: Represents an integer K.
• X: Represents an array of integers of size N.

Input format

Note: This is the input format that you must use to provide custom input (available above the Compile and Test button).

• The first line contains a single integer T which denotes the number of test cases. T also specifies the number of times you have to run the solve function on a different set of inputs.
• The first line contains two space-separated integers N and K.
• The third line contains N space-separated integers denoting the array X.

Output format

For each test case, print the answer in a new line.

Constraints

$1 ≤ T ≤ 50$
$1 ≤ N ≤ 3 \times 10^5$
$1 ≤ X[i], K ≤ 10^8$ (X[i] denotes the $i^{th}$ element of the array X)
Sum of N over all test cases in a file will be at most $5 \times 10^6$

Code snippets (also called starter code/boilerplate code)

This question has code snippets for C, CPP, Java, and Python.