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: Wrong Answer)

def gcd(n, m)
  n, m = m, n if m > n
  loop {
    r = n % m
    break if r == 0
    n, m = m, r
  }
  m
end

def lcm(n, m, g)
  n*m/g
end

while gets do
  a, b = $_.split(/\s/).map(&:to_i)
  g = gcd(a, b)
  l = lcm(a, b, g)
  print "#{g} #{l}"
end