Maximum Bands Performance

You are given multiple test cases. In each test case, there are M time slots and an integer L specifying the minimum duration required for a band to perform successfully. Following these, you are provided with M integers where the i-th integer represents the duration available in the i-th time slot.

A band may perform if and only if the duration of its slot satisfies the inequality \[ d_i \geq L \] where \(d_i\) is the duration of slot i. Your task is to compute the maximum number of bands that can perform, which is simply the number of time slots that have a duration of at least L.

inputFormat

The input begins with an integer T denoting the number of test cases. Each test case is described as follows:

• The first line contains two space-separated integers M and L, where M is the number of time slots and L is the minimum required duration for a band to perform.
• The second line contains M space-separated integers representing the durations of the time slots.

outputFormat

For each test case, output a single integer on a new line representing the maximum number of bands that can perform.

## sample

3
5 3
2 3 4 5 1
4 2
1 2 1 2
3 3
3 3 2

3
2
2

</p>