Final Exam is coming! Cuber QQ has now one night to prepare for tomorrow's exam.
The exam will be a exam of problems sharing altogether mm points. Cuber QQ doesn't know about the exact distribution. Of course, different problems might have different points; in some extreme cases, some problems might worth 00 points, or all mm points. Points must be integers; a problem cannot have 0.50.5 point.
What he knows, is that, these nn problems will be about nn totally different topics. For example, one could be testing your understanding of Dynamic Programming, another might be about history of China in 19th century. So he has to divide your night to prepare each of these topics separately. Also, if one problem is worth xx points in tomorrow's exam, it takes at least x+1x+1 hours to prepare everything you need for examination. If he spends less than x+1x+1 hours preparing, he shall fail at this problem.
Cuber QQ's goal, strangely, is not to take as much points as possible, but to solve at least kk problems no matter how the examination paper looks like, to get away from his parents' scoldings. So he wonders how many hours at least he needs to achieve this goal.
Input
The first line of the input is an integer tt (1≤t≤20 0001≤t≤20 000), denoting the number of test cases.
Each test case are three space-separated integers n,m,kn,m,k (0≤m≤1090≤m≤109, 1≤k≤n≤1091≤k≤n≤109).
Output
For each test case, output the number of hours Cuber QQ needs.
Cuber QQ should solve one problem in sample 1, so he at least prepares 11 hours when the problem one is 10 point.
Cuber QQ should solve all the ten problems in sample 2, so he at least prepares 110 hours for each problem because there may be one problem is 109 point.