PROGRAMMING:Greatest common divisor and least common multiple
This problem requires the greatest common divisor and the least common multiple of two given positive integers.
###Input format:
The input gives two positive integers m and n ($$$Le 1000 $$) in one line.
###Output format:
Output the greatest common divisor and the least common multiple of M and N in a row, separated by 1 space.
###Input example:
```in
511 292
```
###Output example:
```out
73 2044
```
**Thanks to Duan Xiaoyun of Anyang Normal University and Li Fulong of class 5 of software engineering for supplementing test data**< br>
answer：If there is no answer, please comment
###Input format:
The input gives two positive integers m and n ($$$Le 1000 $$) in one line.
###Output format:
Output the greatest common divisor and the least common multiple of M and N in a row, separated by 1 space.
###Input example:
```in
511 292
```
###Output example:
```out
73 2044
```
**Thanks to Duan Xiaoyun of Anyang Normal University and Li Fulong of class 5 of software engineering for supplementing test data**< br>
answer：If there is no answer, please comment