PROGRAMMING:Finding the greatest common divisor and the least common multiple of two integers by function
Write two functions to calculate the greatest common divisor and the least common multiple of two integers respectively, and call these two functions with the main function, and then output the results. Two integers are entered by the keyboard. The maximum common divisor is a positive integer
###Input format:
Integers n and M whose inputs are not zero (the product of N and M is still in the range of integers)
###Output format:
Output the greatest common divisor and the least common multiple of the two integers
###Input example:
```in
24 36
-48 128
```
###Output example:
```out
12 72
16 -384
```
###Tips
Common divisor, common multiple
It is suggested that if there are negative in a and B, the least common multiple will be negative
answer:If there is no answer, please comment
###Input format:
Integers n and M whose inputs are not zero (the product of N and M is still in the range of integers)
###Output format:
Output the greatest common divisor and the least common multiple of the two integers
###Input example:
```in
24 36
-48 128
```
###Output example:
```out
12 72
16 -384
```
###Tips
Common divisor, common multiple
It is suggested that if there are negative in a and B, the least common multiple will be negative
answer:If there is no answer, please comment