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)


int_x, int_y = gets.split(" ").map(&:to_i)

if int_y < int_x
  a = int_x
  b = int_y
else
  b = int_x
  a = int_y
end

a_1 = a;
gcd = b

while a_1 % gcd != 0
  temp = gcd
  gcd = a_1 % gcd
  a_1 = temp
end
lcm = 0

lcm = (a * b) / gcd
puts "#{gcd} #{lcm}"