Baby Ming and Weight lifting

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 65536/65536 K (Java/Others)


Baby Ming is fond of weight lifting. He has a barbell pole(the weight of which can be ignored) and two different kinds of barbell disks(the weight of which are respectively $a$ and $b$), the amount of each one being infinite.

Baby Ming prepare to use this two kinds of barbell disks to make up a new one weighted $C$(the barbell must be balanced), he want to know how to do it.


In the first line contains a single positive integer $T$, indicating number of test case.

For each test case:

There are three positive integer $a, b$, and $C$.

$1 \leq T \leq 1000, 0 < a, b, C \leq 1000, a \neq b$


For each test case, if the barbell weighted $C$ can’t be made up, print Impossible.

Otherwise, print two numbers to indicating the numbers of $a$ and $b$ barbell disks are needed. (If there are more than one answer, print the answer with minimum $a+b$)

Sample Input

2 1 2 6 1 4 5

Sample Output

2 2 Impossible




BestCoder Round #69 (div.2)