There is an infinite one dimensional array ranging from (-infinity, infinity). You are currently at cell number 0. Your goal is to reach cell number H. There are two kinds of moves allowed.

• Make U steps to the right (positive side).
• Make D steps to the left (negative side).

Your task is to find the minimum number of moves to reach your goal.

Input & Output:

The first line contains the number of test cases T. Each of the next T lines contains 3 space separated integers, H U D. For each test case, output one line with an integer, the minimum number of moves required to reach H from 0. If it is impossible , print -1 instead.

Constraints:

T ≤ 10000
1 ≤ H, U, D ≤ 109