#K77062. John's Weekly Goal Challenge

    ID: 34781 Type: Default 1000ms 256MiB

John's Weekly Goal Challenge

John's Weekly Goal Challenge

John is training to achieve a specific distance goal. Initially, he has covered a distance of D miles, and his goal is to reach G miles. Every week, he increases his distance by Y miles. Your task is to determine the number of weeks required for John to reach his goal.

The number of weeks needed can be computed using the formula:

$$\text{weeks} = \frac{G-D}{Y}$$

It is guaranteed that G - D is divisible by Y, so an integer division is sufficient. If John's current distance is already equal to his goal (i.e. \(D = G\)), then no additional weeks are required.

Read the input from stdin and output the result for each test case to stdout.

inputFormat

The first line of input contains a single integer \(T\), the number of test cases. Each of the following \(T\) lines contains three space-separated integers: \(D\), \(G\), and \(Y\), where \(D\) is the initial distance, \(G\) is the goal distance, and \(Y\) is the weekly increase in distance.

outputFormat

For each test case, output a single integer on a new line representing the number of weeks required for John to reach his goal.

## sample
3
10 30 5
40 100 10
20 50 10
4

6 3

</p>