Write a program that answers the following question ~Q~ times:

Given three integers ~A~, ~B~, and ~C~, find the integer ~N~ where ~\lfloor \frac N A \rfloor = B~ and ~N \equiv C \pmod A~.

Constraints

~1 \le Q \le 10^5~

~1 \le A, B, C \le 10^9~

Input Specification

The first line contains ~Q~. The following ~Q~ lines contain 3 integers ~A~, ~B~, and ~C~.

Output Specification

For each question, output on a separate line ~N~, the integer that satisfies the conditions.

Sample Input

1
6 5 11

Sample Output

35

Explanation

~N = 35~ satisfies both conditions when ~A = 6, B = 5, C = 11~: ~\lfloor \frac{35}{6} \rfloor = 5~, and ~35 \equiv 11 \pmod 6~.