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 input=gets do
  a,b=input.split(" ").collect do |x|
    x.to_i
  end
  ac=a
  bc=b
  if ac<bc
    mem=ac
    ac=bc
    bc=mem
  end
  until bc==0 do
    mem=ac%bc
    ac=bc
    bc=mem
  end
  print ac," ",a*b/ac,"\n"
end