In the Shower

Time limit1sMemory limit256 MB

Summary

Count, for each test case, how many of the N bottles need more than E attempts and are empty.

Level: Easy1 of 10
Topics: Array
Solved: No attempts yet

Problem

Your roommate left a somewhat passive-aggressive post-it note asking how many empty shampoo bottles you really need to keep in the shower. A passive-aggressive post-it note usually starts with a single number $P$ , the count of passive-aggressive statements and questions on it, followed by $P$ lines. When $P$ is 1 that line is normally left out and the whole note is just one statement or question. That is by far the most common case.

Somewhat worn out by your roommate's inability to count, you decide to write a program that any of your roommates can run whenever they wonder how many empty shampoo bottles a happy life here requires. Different roommates have different definitions of empty, so each of them enters that definition before getting an answer.

Input

The first line contains $T$ , the number of cases. $T$ cases follow.

The first line of each case contains two integers separated by a space: $E$ , the number of attempts you may make at extracting a visible amount of shampoo, and $N$ , the number of candidate bottles.

Then follow $N$ lines, each with a single integer giving how many attempts a particular bottle needed. If the attempt count exceeds $E$ , the bottle counts as empty.

$1 \le T \le 100$
$1 \le E \le 1000$
$1 \le N \le 10$
Each attempt count is an integer from 1 to 1000.

Output

For each case, print the number of empty shampoo bottles on its own line.

Examples5

Example 1
Input
```
1
5 3
1
5
6
```
Expected output
```
1
```
Example 2
Input
```
1
1 4
2
2
3
100
```
Expected output
```
4
```
Example 3
Input
```
1
7 5
7
7
7
1
7
```
Expected output
```
0
```
Example 4
Input
```
1
1 1
1
```
Expected output
```
0
```

Example 5

Input

Expected output

1
1
0