1956 人解决，2212 人已尝试。
2452 份提交通过，共有 4963 份提交。
0.6 EMB 奖励。
单点时限: 2.0 sec
内存限制: 256 MB
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.
2 8 6 5000 3000
2 24 1000 15000
1956 人解决，2212 人已尝试。
2452 份提交通过，共有 4963 份提交。
0.6 EMB 奖励。