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 JavaScript (judge verdict: Wrong Answer)

// ??\???????????\??????
var input = require("fs").readFileSync("/dev/stdin","utf8");

var array = (input.trim()).split("\n");
for (var i = 0; i < array.length; i++) {
 var splited = array[i].split(" ");
//??§?????????????????????
 splited.sort(function(d, e){
   return e - d
 })
 console.log(splited)
 test(splited)
}


// ?????\??????????????????????????????
function test(data) {
   var a = data[0]
   var b = data[1]
  // c_multi=????°???¬?????° gcd=?????§??¬?´???°
  // ?????§??¬?´???°????±???????
  var x = a;
  var y = b;
  var z;
  while ((z = x % y) != 0) {
    x = y
    y = z
  }
  var gcd = y
  // ????°???¬?????°????±???????
  var lcm = a * b / gcd
  // ??¨?¨?
  console.log(lcm + " " + gcd)
}