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)

a = []
b = []
count = 0

while n = gets
  ax, bx = n.chomp.split(" ")
  a[count], b[count] = ax.to_i, bx.to_i
  count += 1
end

for i in 0..count-1
  aa = a[i]
  bb = b[i]

  if b[i] > a[i]
    a[i] = b[i]
    b[i] = aa
  end

  while b[i] != 0
    c = a[i] % b[i]
    a[i] = b[i]
    b[i] = c
  end

  puts a[i].to_s + " " + ((aa/a[i])*(bb/a[i])*a[i]).to_s
end