Loading [MathJax]/jax/output/HTML-CSS/fonts/TeX/fontdata.js

D. Problem about GCD
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Given three integers l, r, and G, find two integers A and B (lABr) such that their greatest common divisor (GCD) equals G and the distance |AB| is maximized.

If there are multiple such pairs, choose the one where A is minimized. If no such pairs exist, output "-1 -1".

Input

The first line contains a single integer t (1t103) — the number of test cases. Then, t test cases follow.

Each test case consists of a single line containing three integers l,r,G (1lr1018; 1G1018) — the range boundaries and the required GCD.

Output

For each test case, output two integers A and B — the solution to the problem, or "-1 -1" if no such pair exists.

Example
Input
4
4 8 2
4 8 3
4 8 4
5 7 6
Output
4 6
-1 -1
4 8
6 6