#590 Subway Seats

Loading problem...

Preparing the statement, recent submissions, and submit form.

Time limit: 1000 ms
Memory limit: 1024 MB
Checker: TOKEN
Solve threshold: 100

Statement

Statement language

There are $N$ seats in one subway car, and initially every seat is empty.

Then $M$ passengers board one by one. Each passenger chooses one seat number they want.

If the chosen seat is empty, the passenger sits there. If another passenger is already sitting there, the passenger must remain standing.

Find the number of passengers standing after everyone has boarded.

Input

The input is given from Standard Input in the following format:

$T$ $\mathrm{case}_1$ $\mathrm{case}_2$ $\vdots$ $\mathrm{case}_T$

Each case is given in the following format:

$N\ M$ $A_1\ A_2\ \cdots\ A_M$

$A_i$ is the seat number chosen by the $i$ -th passenger.

Output

For each test case, print the number of passengers standing after everyone has boarded, on one line.

Constraints

$1 \leq T \leq 100$ .
$1 \leq N \leq 100$ .
$1 \leq M \leq 100$ .
$1 \leq A_i \leq N$ ( $1 \leq i \leq M$ ).
The sum of $M$ over all test cases does not exceed $10\,000$ .

Subtasks

#	Score	Constraints
1	11	$N \leq 3$ . $M \leq 5$ . The sum of $M$ over all test cases does not exceed $20$ .
2	27	$M \leq 20$ . The sum of $M$ over all test cases does not exceed $200$ .
3	62	No additional constraints.

Samples

Input

1
5 7
1 2 2 5 3 1 4

Output

In the first test case, the passengers who request seats $2$ and $1$ for the second time cannot sit down. Therefore, a total of $2$ passengers must remain standing.