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: Time Limit Exceeded)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.IO;

namespace ConsoleApplication2 {
    class Program {
        static void Main(string[] args) {

            TextReader input = Console.In;

            string str = "";

            while((str = input.ReadLine()) != null) {
                // スペースで区切る
                string[] works = str.Split(' ');
                // 2 個でない場合
                if (works.Length != 2) {
                    continue;
                }

                // GCD LCM
                long a, b;
                if (!long.TryParse(works[0], out a)) {
                    continue;
                }
                if (!long.TryParse(works[1], out b)) {
                    continue;
                }
                long cnt = 0;
                if (a < b) {
                    cnt = b;
                } else {
                    cnt = a;
                }
                //long gcd = 0;
                //long lcm = 0;

                // 最大公約数
                for (long ii = cnt; ii > 0; ii--) {
                    if (a % ii == 0 && b % ii == 0) {
                        Console.WriteLine(ii);
                        break;
                    }
                }

                // 最小公倍数
                for (long ii = 1; ii <= 2000000000; ii++) {
                    if (ii % a == 0 && ii % b == 0) {
                        Console.WriteLine(ii);
                        break;
                    }
                }
            }
        }
    }
}