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 main(){
	long n[2];
	long i, j, x, y;
	while(scanf("%d %d",&n[0],&n[1])!=EOF){
		for(i=1;;i++){
			x = n[0]*i;
			if(x%n[1]==0){
				break;
			}
		}
		for(j=1;;j++){
			if(n[0]%j!=0) continue;
			y = n[0]/j;
			if(n[1]%y==0){
				break;
			}
		}
		printf("%d %d\n",y,x);
	}
	return 0;
}