PROGRAMMING:Common divisor and common multiple

###Task description
Yu Long is baffled by a question. Now he needs your help. The problem is: give two positive integers, find their greatest common divisor and least common multiple.
###Input format:
In the first line, enter an integer n (0 < n < = 10000), indicating that there are n groups of test data;
In the next N lines, enter two integers i, J (0 < I, J < = 32767).
###Output format:
Output the greatest common divisor and the least common multiple of each group of test data
###Input example:
```in
three
6 6
12 11
33 22
```
###Output example:
```out
6 6
1 132
11 66
```
###Title Source
Note: this topic is selected from nyoj website http://nyoj.top/problem/40







answer：If there is no answer, please comment