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 C# (judge verdict: Accepted)

using System;

public class p0005
{
	p0005(){
		string str;
		string[] s;
		decimal dc, a, b;
		
		while((str=Console.ReadLine()) != null){
			s = str.Split(' ');
			a = decimal.Parse(s[0]);
			b = decimal.Parse(s[1]);
			dc = gcd(a, b);
			Console.WriteLine("{0} {1}", dc, (a/dc*b));
		}
	}
	
	public decimal gcd(decimal a, decimal b){
		if(b == 0) return a;
		return gcd(b, a%b);
	}
	
	public static int Main(string[] args){
		new p0005();
		return 0;
	}
}