PROGRAMMING:Come on, hurt me!
Xiao pan is the best math student in his class. One day, the teacher asked him to find the greatest common divisor and the least common multiple of two natural numbers m and Z (M > z),
Because Xiao pan thinks this topic is too simple, Xiao pan wants you to use the code to help him find the result directly.
###Input format:
An N in the first line indicates that there are n groups of inputs,
Next, there are n rows, each with m, Z (M > z),
1<=M,Z,N<=1000000
###Output format:
For each group of data, the greatest common divisor and the least common multiple of M and Z are output respectively
When n input error, directly end the program and output "wrong".
###Input sample 1:
```in
two
2 4
12 24
```
###Output sample 1:
```out
2 4
12 24
```
###Input sample 2:
```in
-1
```
###Output sample 2:
```out
WRONG
```
answer：If there is no answer, please comment
Because Xiao pan thinks this topic is too simple, Xiao pan wants you to use the code to help him find the result directly.
###Input format:
An N in the first line indicates that there are n groups of inputs,
Next, there are n rows, each with m, Z (M > z),
1<=M,Z,N<=1000000
###Output format:
For each group of data, the greatest common divisor and the least common multiple of M and Z are output respectively
When n input error, directly end the program and output "wrong".
###Input sample 1:
```in
two
2 4
12 24
```
###Output sample 1:
```out
2 4
12 24
```
###Input sample 2:
```in
-1
```
###Output sample 2:
```out
WRONG
```
answer：If there is no answer, please comment