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)

a = 2000000000
b = 2000000000
while a >= 2000000000 && b >= 2000000000 do
  a = gets.chomp.to_i
  b = gets.chomp.to_i
end

if a > b then
  c = a
else
  c = b
end

d = 0

for i in 1..c do
  if a % i == 0 && b % i == 0 then
    d = i
    end
  end
print d
print " "

for i in 1..2000000000 do
  if i % a == 0 && i % b == 0 then
    print i
    break
    end
  end