Flowers
时间限制:C/C++/Rust/Pascal 1秒,其他语言2秒
空间限制:C/C++/Rust/Pascal 256 M,其他语言512 M
64bit IO Format: %lld

题目描述

Recently Jack becomes much more romantic. He would like to prepare several bunches of flowers.

Each bunch of flowers must have exactly M flowers. As Jack does not want to be boring, he hopes that flowers in the same bunch are all different species. Now there are species of flowers in the flower shop, and the number of the i-th species of flower is a_i. Now Jack would like to know how many bunches of flowers he can prepare at most.

输入描述:

The first line contains an integer  () --- the number of test cases.
In the first line of each test case, there are two integers , () --- the number of flowers' species and the number of flowers in a bunch.
In the second line of each test case, there are integers --- the -th integer indicates a_i (), the number of -th species' flowers.

输出描述:

For each test case, output one integer in one line --- the answer of the corresponding test case.
示例1

输入

复制
1 
5 3 
1 1 1 2 1

输出

复制
2