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 C (judge verdict: Time Limit Exceeded)

#include <stdio.h>

int yakusuu(int a,int b);

int main(void){
int a,b,c;
scanf("%d %d",&a,&b);
c=yakusuu(a,b);
printf("%d %d\n",c,(a/c)*(b/c)*c);
return 0;
}

int yakusuu(int a,int b){
int n=2,c=1;
while(n<a && n<b){
if(a%n==0 && b%n==0){
a/=n;
b/=n;
c*=n;
}
}
return c;
}