单点时限: 2.0 sec
内存限制: 256 MB
Write a program which computes the greatest common divisor (GCD) and the least common multiple (LCM) of given and .
The first line of input gives the number of cases, . 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