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;
using System.Linq;

namespace _0005
{
    class Program
    {
        static void Main(string[] args)
        {
            while (true)
            {
                string input = Console.ReadLine();
                if (input == null)
                {
                    break;
                }
                int[] x = input.Split().Select(int.Parse).ToArray();
                int GCD = x[0];
                while (true)
                {
                    if (x[0] % GCD == 0 && x[1] % GCD == 0)
                    {
                        break;
                    }
                    GCD--;
                }
                long LCM = x[0] / GCD * x[1];
                Console.WriteLine(GCD + " " + LCM);
            }
        }
    }
}