Counting Numbers Greater Than or Equal to X

You are given a sequence of integers and an integer X. For each test case, your task is to count how many numbers in the sequence are greater than or equal to X.

Formally, given a sequence \(a_1, a_2, \dots, a_n\) and an integer \(X\), find the number of indices \(i\) such that \(a_i \ge X\). You need to process multiple test cases.

Input: The first line contains an integer t denoting the number of test cases. For each test case, the first line contains two integers n and X, where n is the length of the sequence. The following line contains n space-separated integers representing the sequence.

Output: For each test case, output a single integer representing the count of numbers in the sequence that are greater than or equal to X. Each result should be printed on a new line.

inputFormat

The input begins with a single integer t (\(1 \le t \le 10^4\)) representing the number of test cases. Each test case is described in two lines. The first line of each test case contains two integers n (the number of elements in the sequence) and X (the chosen integer). The second line contains n space-separated integers representing the sequence.

outputFormat

For each test case, output a single number on a new line: the count of numbers in the sequence that are greater than or equal to X.

## sample

1
5 3
1 2 3 4 5

3

</p>