A14613 | Save More Mice

There are one cat, $k$ mice, and one hole on a coordinate line. The cat is located at the point $0$ , the hole is located at the point $n$ . All mice are located between the cat and the hole: the $i$ -th mouse is located at the point $x_i$ ( $0 < x_i < n$ ). At each point, many mice can be located.

In one second, the following happens. First, exactly one mouse moves to the right by $1$ . If the mouse reaches the hole, it hides (i.e. the mouse will not any more move to any point and will not be eaten by the cat). Then (after that the mouse has finished its move) the cat moves to the right by $1$ . If at the new cat's position, some mice are located, the cat eats them (they will not be able to move after that). The actions are performed until any mouse hasn't been hidden or isn't eaten.

In other words, the first move is made by a mouse. If the mouse has reached the hole, it's saved. Then the cat makes a move. The cat eats the mice located at the pointed the cat has reached (if the cat has reached the hole, it eats nobody).

Each second, you can select a mouse that will make a move. What is the maximum number of mice that can reach the hole without being eaten?

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

Each test case consists of two lines. The first line contains two integers $n$ and $k$ ( $2 \le n \le 10^9$ , $1 \le k \le 4 \cdot 10^5$ ). The second line contains $k$ integers $x_1, x_2, \dots x_k$ ( $1 \le x_i < n$ ) — the initial coordinates of the mice.

It is guaranteed that the sum of all $k$ given in the input doesn't exceed $4 \cdot 10^5$ .

For each test case output on a separate line an integer $m$ ( $m \ge 0$ ) — the maximum number of mice that can reach the hole without being eaten.