Minimum Number of Trays

You are given (T) test cases. For each test case, you are provided with three integers (M), (Y), and (K) representing the number of guests, the number of servings each guest requires, and the number of servings that can be obtained from a single tray, respectively. Your task is to determine the minimum number of trays required to serve all guests.

Mathematically, if each guest requires (Y) servings, then the total number of servings needed is (M \times Y). Since each tray provides (K) servings, the minimum number of trays needed is given by (\lceil \frac{M \times Y}{K} \rceil), where (\lceil x \rceil) denotes the ceiling of (x), i.e. the smallest integer not less than (x).

inputFormat

The input is given via standard input (stdin) and has the following format:

(T)
(M) (Y) (K)
... (repeated for each of the (T) test cases)

Where:
- (T) is the number of test cases.
- Each test case consists of three space-separated integers (M), (Y), and (K).

outputFormat

For each test case, output the minimum number of trays required on a separate line using standard output (stdout).## sample

3
5 4 6
3 8 5
10 2 4

4
5
5