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

<?php
fscanf( STDIN, "%d", $count );

for($i=0;$i<$count;$i++){

fscanf( STDIN, "%d %d", $a, $b );

list( $x, $y ) = ( $a > $b )? [ $a, $b ] : [ $b, $a ];#x>y
while( $y ){#to r=0
  $r = $x % $y;
  $x = $b;
  $y = $r;
}
$gcd = $x;#a: gcd, b: 0????????£?????????
$lcm = $a / $gcd * $b;

printf( "%d %d\n", $gcd, $lcm );
}
?>