BThero is a powerful magician. He has got nn piles of candies, the i-th pile initially contains aiai candies. BThero can cast a copy-paste spell as follows:

1. He chooses two piles (i,j) such that 1≤i,j≤n and i≠j.
2. All candies from pile i are copied into pile j. Formally, the operation aj:=aj+ai is performed.

BThero can cast this spell any number of times he wants to — but unfortunately, if some pile contains strictly more than k candies, he loses his magic power. What is the maximum number of times BThero can cast the spell without losing his power?

The first line contains one integer TT (1≤T≤500) — the number of test cases.

Each test case consists of two lines:

• the first line contains two integers nn and kk (2≤n≤1000, 2≤k≤10的4次方);
• the second line contains nn integers a1, a2, ..., an (1≤ai≤k1≤ai≤k).

It is guaranteed that the sum of n over all test cases does not exceed 1000, and the sum of k over all test cases does not exceed 10的四次方.