CF1701C.Schedule Management

There are $n$ workers and $m$ tasks. The workers are numbered from $1$ to $n$ . Each task $i$ has a value $a_i$ — the index of worker who is proficient in this task.

Every task should have a worker assigned to it. If a worker is proficient in the task, they complete it in $1$ hour. Otherwise, it takes them $2$ hours.

The workers work in parallel, independently of each other. Each worker can only work on one task at once.

Assign the workers to all tasks in such a way that the tasks are completed as early as possible. The work starts at time $0$ . What's the minimum time all tasks can be completed by?

The first line contains a single integer $t$ ( $1 \le t \le 10^4$ ) — the number of testcases.

The first line of each testcase contains two integers $n$ and $m$ ( $1 \le n \le m \le 2 \cdot 10^5$ ) — the number of workers and the number of tasks.

The second line contains $m$ integers $a_1, a_2, \dots, a_m$ ( $1 \le a_i \le n$ ) — the index of the worker proficient in the $i$ -th task.

The sum of $m$ over all testcases doesn't exceed $2 \cdot 10^5$ .

For each testcase, print a single integer — the minimum time all tasks can be completed by.

In the first testcase, the first worker works on tasks $1$ and $3$ , and the second worker works on tasks $2$ and $4$ . Since they both are proficient in the corresponding tasks, they take $1$ hour on each. Both of them complete $2$ tasks in $2$ hours. Thus, all tasks are completed by $2$ hours.

In the second testcase, it's optimal to assign the first worker to tasks $1, 2$ and $3$ and the second worker to task $4$ . The first worker spends $3$ hours, the second worker spends $2$ hours (since they are not proficient in the taken task).

In the third example, each worker can be assigned to the task they are proficient at. Thus, each of them complete their task in $1$ hour.