#include<bits/stdc++.h>
#define int long long
using namespace std;
int gcd(int a,int b){
	if(b==0)return a;
	return gcd(b,a%b);
	}
signed main()
{
	int a,b;
	while(cin>>a>>b){
	 cout<<gcd(a,b)<<" "<<a*b/gcd(a,b)<<endl;
		}
	}
### Prompt

Please provide a cpp coded solution to the problem described below:

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<bits/stdc++.h>
#define int long long
using namespace std;
int gcd(int a,int b){
	if(b==0)return a;
	return gcd(b,a%b);
	}
signed main()
{
	int a,b;
	while(cin>>a>>b){
	 cout<<gcd(a,b)<<" "<<a*b/gcd(a,b)<<endl;
		}
	}
```