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;
class Program
{
    static void Main()
    {
        string input = Console.ReadLine();
        int[] inputArray = new int[2];
        for (int i = 0; i < 2; i++)
        {
            inputArray[i] = int.Parse(input.Split(' ')[i]);
        }
        Console.WriteLine(GCD(inputArray[0], inputArray[1]) + " " + LCM(inputArray[0], inputArray[1]));
    }

    static long GCD(long a, long b)
    {
        return b == 0 ? a : GCD(b, a % b);
    }

   static long LCM(long a, long b)
    {
        return (a * b) / GCD(a, b);
    }
}