B. Aziz Teams Qualifications
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

GJU is hosting its qualification contest to select the best teams to represent the university at the Jordanian Collegiate Programming Contest (JCPC).

There are $$$n$$$ teams participating, and the $$$i$$$-th team solved $$$a_i$$$ problems during the contest. Aziz, the contest director, has set a strict qualification rule: a team will qualify for the JCPC if and only if they solved strictly more than $$$x$$$ problems.

Your task is to help Aziz calculate exactly how many teams have qualified for the JCPC.

Input

The first line contains a single integer $$$t$$$ ($$$1 \le t \le 10^4$$$) — the number of test cases.

The first line of each test case contains two integers $$$n$$$ and $$$x$$$ ($$$1 \le n \le 10^5$$$, $$$0 \le x \le 20$$$) — the number of teams and the qualification threshold.

The second line of each test case contains $$$n$$$ integers $$$a_1, a_2, \ldots, a_n$$$ ($$$0 \le a_i \le 20$$$) — the number of problems solved by each team.

It is guaranteed that the sum of $$$n$$$ over all test cases does not exceed $$$2 \cdot 10^5$$$.

Output

For each test case, output a single integer — the total number of teams that qualified for the JCPC.

Example
Input
3
5 2
1 2 3 4 5
3 5
5 5 5
6 0
0 1 0 2 0 3
Output
3
0
3