Solve the programming task below in a Python markdown code block.
Chef has N empty bottles where each bottle has a capacity of X litres.  
There is a water tank in Chefland having K litres of water. Chef wants to fill the empty bottles using the water in the tank.  

Assuming that Chef does not spill any water while filling the bottles, find out the maximum number of bottles Chef can fill completely.

------ Input Format ------ 

- First line will contain T, number of test cases. Then the test cases follow.
- Each test case contains of a single line of input, three integers N, X, and K.

------ Output Format ------ 

For each test case, output in a single line answer, the maximum number of bottles Chef can fill completely.

------ Constraints ------ 

$1 ≤ T ≤ 100$
$1 ≤ N, X ≤ 10^{5}$
$0 ≤ K ≤ 10^{5}$

----- Sample Input 1 ------ 
3
5 2 8
10 5 4
3 1 4
----- Sample Output 1 ------ 
4
0
3
----- explanation 1 ------ 
Test Case $1$: The amount of water in the tank is $8$ litres. The capacity of each bottle is $2$ litres. Hence, $4$ water bottles can be filled completely.

Test Case $2$: The amount of water in the tank is $4$ litres. The capacity of each bottle is $5$ litres. Hence, no water bottle can be filled completely.

Test Case $3$: The amount of water in the tank is $4$ litres. The capacity of each bottle is $1$ litre. Chef has $3$ bottles available. He can fill all these bottles completely using $3$ litres of water.