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 GCDandLCM
{
    class Program
    {
        static void Main(string[] args)
        {
            string buf;
            while (!string.IsNullOrEmpty(buf = Console.ReadLine()))
            {
                double[] inputs = Array.ConvertAll(buf.Split(' '), double.Parse);
                double gcd;
                if (inputs[0] > inputs[1])
                {
                    gcd = Myfunc(inputs[0], inputs[1]);
                }
                else
                {
                    gcd = Myfunc(inputs[1], inputs[0]);

                }
                Console.WriteLine("{0} {1}", gcd, inputs[0] * inputs[1] / gcd);
            }
        }


        public static double Myfunc(double a, double b)
        {
            if (b == 0)
            {
                return a;
            }
            return Myfunc(b, a % b);
        }
    }
}