Greatest Common Divisor and Least Common Multiple

Problem Description

Read $T$; there are $T$ groups of data. Each group gives two numbers $a, b$; output their greatest common divisor and least common multiple.

Input Format

The first line contains one number $T$.

The following $T$ lines each contain two numbers $a, b$.

Output Format

$T$ lines in total, each with two numbers: the greatest common divisor and the least common multiple, respectively.

Sample Input

2
1 2
100 150

Sample Output

1 2
50 300

Constraints

For $100\%$ of the data, it is guaranteed that $1\leq T\leq 10^4$, $1\leq a, b\leq 10^9$.

Hint

• Compute $\gcd(a,b)$ with the Euclidean algorithm; then $\operatorname{lcm}(a,b) = a \cdot b / \gcd(a,b)$. Beware of overflow when multiplying $a$ and $b$ (use 64-bit integers).