Maximum Snack Count

You are given several test cases. For each test case, you will be provided with the number of snack types, the maximum capacity of a car, and a list of snack weights. Your task is to determine the maximum number of snacks that can be carried by repeatedly choosing the snack with the smallest weight. Mathematically, for a test case with capacity (C) and a minimum snack weight (w_{min}), the maximum number of snacks is given by (\lfloor\frac{C}{w_{min}}\rfloor).

inputFormat

The input is given via standard input in the following format:\n\n- The first line contains an integer (T) representing the number of test cases.\n- For each test case, the first line contains two integers (N) and (C), where (N) is the number of different snack types and (C) is the maximum capacity of the car.\n- The second line contains (N) space-separated integers that represent the weights of each snack type.

outputFormat

For each test case, output a single line containing the maximum number of snacks that can be carried without exceeding the car's capacity.## sample

3
2 10
5 3
3 8
2 1 5
4 20
4 5 6 2

3
8
10