Problem:
GCD and LCM

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

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.

Constraints

0 < a, b ≤ 2,000,000,000

LCM(a, b) ≤ 2,000,000,000

The number of data sets ≤ 50

Output

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

Sample Input

8 6
50000000 30000000

Output for the Sample Input

2 24
10000000 150000000

Solution in JavaScript (judge verdict: Accepted)

process.stdin.on("data",function(c){
	(c+"").trim().split("\n").some(function(n,m,h){
		n=n.split(" "),m=+n[1],n=+n[0];
		var g=function(m,n,t){
			m<n&&(t=n,n=m,m=t);
			while(n=m%(m=n));
			return m;
		};
		console.log(h=g(n,m),n*m/h);
	});
}).resume();