Description
There is a snail on the ground. This snail will climb a wooden stick that is V meters high.
The snail can climb A meters during the day. However, it slides B meters while sleeping at night. Also, it does not slide once it reaches the top.
Write a program to calculate how many days it takes for the snail to climb the entire wooden stick.
Input
The first line contains the number of test cases, t, as an integer. (1 ≤ t ≤ 10)
The following t lines contain three integers A, B, and V separated by spaces. (1 ≤ B < A ≤ V ≤ 1,000,000,000)
Output
For each test case, output the number of days it takes for the snail to climb all the wooden sticks, one per line.
3
2 1 5
5 1 6
100 99 1000000000