Fady is organizing a movie night. The cinema has an infinite number of rows, with each row containing exactly seats. The seats are numbered consecutively starting from (seats to are in row , seats m+1 to are in row , and so on).
Fady needs to book exactly consecutive seats, starting precisely at seat number .
Calculate the total number of distinct rows Fady's group will occupy.
The first line contains a single integer (1 \le t \le 10^4) — the number of test cases.
Each of the next lines contains three integers , , and (1 \le m, n, s \le 10^{18}) — the number of seats per row, the number of consecutive seats to book, and the starting seat number, respectively.
For each test case, output a single integer — the total number of distinct rows occupied by Fady's group.
Example 1
In the first test case, there are seats per row. Fady books seats starting at seat . The booked seats are 2, 3, 4, 5, and .
Seats and are in row .
Seats and are in row .
The group occupies distinct rows in total.
Subtask ( points): \sum n \le 10^5 across all test cases.
Subtask ( points): No additional constraints.