Problem hidden
This problem was hidden by Editorial Board member probably because it has incorrect language version or invalid test data, or description of the problem is not clear.

Problem hidden

PLABON01 - Plabon the rich man


Plabon is a user of multiple bank accounts. He has 'N' accounts where are 'M' money in each account. He has get trouble to divide all the money among 'J' juniors. He wants to divide maximum money from his account to all equally. Help him. 

Input

The first line of the input contains one integer 'T' (1<=T<=50) which indicate the number of tast case.
The second line of the input contains 3 integers 'N','M' and 'J' which indicate the number of bank account ,the amount of money and the number of juniors.

Output

the output will be the maximum amount which can Plabon spent. If the money is less then 1,for each juniors,then plabon will spent all of his money.

Example

Input:
4
2 10 3
2 15 4
5 50 10
5 5 30
Output: 18 28 250 25

Added by:Ruhul
Date:2019-05-09
Time limit:1s-3s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:C NCSHARP C++ 4.3.2 CPP CPP14 JULIA PYTHON PYPY3 PYTHON3