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 Ruby (judge verdict: Accepted)

while line=$stdin.gets do
    a,b=line.split(" ").collect{|x| x.to_i}

    c=a

    d=b

    if c<d

        c,d=d,c

    end

    while d!=0

        c,d=d,c%d

    end

    $stdout.print c," ",(a*b)/c,"\n"
end