Given three integers l, r, and G, find two integers A and B (l≤A≤B≤r) such that their greatest common divisor (GCD) equals G and the distance |A−B| is maximized.
If there are multiple such pairs, choose the one where A is minimized. If no such pairs exist, output "-1 -1".
The first line contains a single integer t (1≤t≤103) — the number of test cases. Then, t test cases follow.
Each test case consists of a single line containing three integers l,r,G (1≤l≤r≤1018; 1≤G≤1018) — the range boundaries and the required GCD.
For each test case, output two integers A and B — the solution to the problem, or "-1 -1" if no such pair exists.
44 8 24 8 34 8 45 7 6
4 6 -1 -1 4 8 6 6
Name |
---|