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;
namespace ConsoleApplication1{
    class Program{
        static void Main(string[] args){
            while (true) {
                String str=Console.ReadLine();
                if (str == null) {
                    break;
                }
                String[] strArray = str.Split();
                long[] a = new long[2];
                for (int i = 0; i < 2; i++) {
                    a[i] = long.Parse(strArray[i]);
                }
                Console.WriteLine(gcd(a[0], a[1]) + " " + lcm(a[0], a[1]));
            }
        }
        static long gcd(long a, long b) {
            if (a % b == 0) {
                return b;
            }
            else {
                return gcd(b, a % b);
            }
        }
        static long lcm(long a, long b) {
            return a * b / gcd(a, b);
        }
    }
}