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: Wrong Answer)

using System;
using System.Linq;

namespace aoj0005
{
	class MainClass
	{
		public static void Main (string[] args)
		{
			while(Console.ReadLine() == null){
			var q = Console.ReadLine().Split(' ');
				var a = long.Parse(q[0]);
			    var b = long.Parse(q[1]);
			if(a<=b){
				long tmp = 0;
				tmp = a;
				b=a;
				b=tmp;
			}
			//a>=b = true;
				
				long gcd = 0;//saidaikouyakusuu
				var m = a; var n =b;
				while(true){
					if(n == 0){gcd = m; break;}
					var tmp2 = n;
					n = m%n;
					m=tmp2;
				}

				
			                // 最小公倍数
                if (gcd == 1) {
                    Console.WriteLine(gcd + " " + a * b);
                } else {
                    Console.WriteLine(gcd + " " + gcd * (a / gcd) * (b / gcd));
                }
			}
		}
	}
}