Let $\phi(n)$ denote Euler’s totient function: the number of integers in $[1,n]$ that are coprime to $n$.

You are given two integers $\ell$ and $r$ with $r \ge \frac{5\ell}{3}$. Find two distinct integers $x$ and $y$ with $\ell \le x,y \le r$ such that $\phi(x)=\phi(y)$, or report that no such pair exists.

Input

The first line contains a single integer $t$ ($1 \le t \le 20$): the number of test cases.

Each of the next $t$ lines contains two integers $\ell$ and $r$ ($1 \le \ell < r \le 10^{17}$) describing one test case. It is guaranteed that $r \ge \frac{5\ell}{3}$.

Output

For each test case, print two integers $x$ and $y$ ($\ell \le x,y \le r$, $x \ne y$) such that $\phi(x)=\phi(y)$, or -1 -1 if no such pair exists. If there are multiple valid pairs, print any one of them.

Examples

Input 1

5
1 3
5 10
15 30
21 50
50 100

Output 1

1 2
5 8
15 16
21 26
52 56