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
#include "iostream"
#include "iomanip"
using namespace std;
int main()
{
	long m, n, a, b, t, c;
	while(cin>>a>>b)
	{
		m=a;   n=b;  
		while(b!=0)  
		{
			c=a%b;
			a=b;
			b=c;
		}
		cout<<a<<' '<<(m/a)*n<<endl;
	}
} 