A15271 | Planets

One day, Vogons wanted to build a new hyperspace highway through a distant system with $n$ planets. The $i$ -th planet is on the orbit $a_i$ , there could be multiple planets on the same orbit. It's a pity that all the planets are on the way and need to be destructed.

Vogons have two machines to do that.

- The first machine in one operation can destroy any planet at cost of $1$ Triganic Pu.
- The second machine in one operation can destroy all planets on a single orbit in this system at the cost of $c$ Triganic Pus.

Vogons can use each machine as many times as they want.

Vogons are very greedy, so they want to destroy all planets with minimum amount of money spent. Can you help them to know the minimum cost of this project?

The first line contains a single integer $t$ ( $1 \le t \le 100$ ) — the number of test cases. Then the test cases follow.

Each test case consists of two lines.

The first line contains two integers $n$ and $c$ ( $1 \le n, c \le 100$ ) — the number of planets and the cost of the second machine usage.

The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ( $1 \le a_i \le 100$ ), where $a_i$ is the orbit of the $i$ -th planet.

For each test case print a single integer — the minimum cost of destroying all planets.