Complete Sentences

In this problem, you are given a number of test cases. For each test case, a participant's typing speed (words per minute, WPM), the number of words in a single sentence, and the duration of the typing contest in minutes are provided. The participant types continuously during the contest, but can only count a sentence as complete if all its words are typed.

Mathematically, if a participant can type a total of $$W = \text{WPM} \times D$$ words during the contest, and the sentence consists of \( L \) words, then the number of complete sentences the participant can type is given by:

$$\text{Complete Sentences} = \left\lfloor \frac{W}{L} \right\rfloor = \left\lfloor \frac{\text{WPM} \times D}{L} \right\rfloor. $$

inputFormat

The first line contains an integer \(T\) representing the number of test cases.

Each of the following \(T\) lines contains three space-separated integers: \(\text{WPM}\) (words per minute), \(L\) (number of words in a sentence), and \(D\) (duration of the contest in minutes).

Note: Input is read from standard input (stdin).

outputFormat

For each test case, print a single line containing the number of complete sentences that the participant can type within the given time.

Note: Output is written to standard output (stdout).

## sample

2
120 20 10
150 30 5

60
25

</p>