**3 人解决**，5 人已尝试。

**3 份提交通过**，共有 24 份提交。

**8.6** EMB 奖励。

**单点时限: **5.0 sec

**内存限制: **256 MB

John and Brus believe that number N is a very bad number. Thus they try to avoid it every time and everywhere.

Now the guys would like to represent number M as a sum of positive numbers, each of which not exceeding K. But don’t forget about the bad number N! Each summand must not be divisible by N, moreover the number of summands also must not be divisible by N.

Your task is to find the minimal possible number of summands in such representation of M.

For example, if N=3, M=11, K=6 then we can represent M as 5+6, but as far as 6 is divisible by 3 we must have at least 3 summands. But as far as N=3 we can’t have 3 summands and thus the answer is 4. One of the possible ways to represent M is 11=4+4+2+1.

The first line contains single integer T – the number of test cases. Each test case consists of a single line containing three integers N, M and K separated by single spaces.

For each test case print a single line containing the minimal possible number of summands according to the requirements described above. If it is impossible to do this output “-1” (quotes for clarity) instead.

Constraints:

1 ≤ T ≤ 74,

1 ≤ N, M, K ≤ 1000000000 (10^{9}).

Input

2 3 11 6 2 12 47

Output

4 -1

**3 人解决**，5 人已尝试。

**3 份提交通过**，共有 24 份提交。

**8.6** EMB 奖励。

**创建**: 12 年，11 月前.

**修改**: 5 年，1 月前.

**最后提交**: 1 年，10 月前.

题目标签