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;
class main
{
    static void Main(string[] args)
    {
        string s = string.Empty;
        while ((s = Console.ReadLine()) != null)
        {
            string[] s1 = s.Split(' ');
            long[] a = new long[3];
            a[0] = long.Parse(s1[0]);
            a[1] = long.Parse(s1[1]);
            a[2] = 0;
            Array.Sort(a);
            Array.Reverse(a);
            long c = a[0] * a[1];
            if (a[1] != 0)
            {
                while (true)
                {
                    a[2] = a[1];
                    a[1] = a[0] % a[1];
                    a[0] = a[2];
                    if (a[1] == 0)
                    {
                        Console.WriteLine("{0} {1}", a[0], (c / a[0]));
                        break;
                    }
                }
            }
            else
            {
                Console.WriteLine("{0} {1}", a[0], (c / a[0]));
            }
        }
    }
}