程序设计能力实训

1093. GCD and LCM

Write a program which computes the greatest common divisor (GCD) and the least common multiple (LCM) of given $a$ and $b$ $(0 < a, b \leq 44000)$.

输入格式

The first line of input gives the number of cases, $N$ $(1 \leq N \leq 100)$. $N$ test cases follow.

Each test case contains two interger a and b separated by a single space in a line.

输出格式

For each test case, print GCD and LCM separated by a single space in a line.

样例

Input
2
8 6
5000 3000

Output
2 24
1000 15000