#include <cstdio>


int gcd(int a,int b) {
    if(b==0) return a;
    else return gcd(b,a%b);
}

int main() {
    int a,b;
    while(scanf("%d %d",&a,&b)!=EOF) {
        int g=gcd(a,b);
        int l=a/g*b;
        printf("%d %d\n",g,l);
    }
}
### Prompt

Your task is to create a CPP solution to the following problem:

Write a program which computes the greatest common divisor (GCD) and the least common multiple (LCM) of given a and b.

Constraints

* 0 < a, b ≤ 2,000,000,000
* LCM(a, b) ≤ 2,000,000,000
* The number of data sets ≤ 50

Input

Input consists of several data sets. Each data set contains a and b separated by a single space in a line. The input terminates with EOF.

Output

For each data set, print GCD and LCM separated by a single space in a line.

Example

Input

8 6
50000000 30000000


Output

2 24
10000000 150000000

### Response

```cpp
#include <cstdio>


int gcd(int a,int b) {
    if(b==0) return a;
    else return gcd(b,a%b);
}

int main() {
    int a,b;
    while(scanf("%d %d",&a,&b)!=EOF) {
        int g=gcd(a,b);
        int l=a/g*b;
        printf("%d %d\n",g,l);
    }
}
```