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 a,b,x,y;
	long a1,a2,i,j;
	
	while (1) {
		
	scanf("%ld %ld",&a,&b);
		if (getchar() == EOF)break;
		if(a>b){
			a1=a;
			a2=b;
		}else{
			a1=b;
			a2=a;
		}
		
		for(i=a2;i>1;i--){
			if(a1%i==0&&a2%i==0)break;
		}
		x=i;
		
		for(i=1;i<=a2;i++){
			for(j=1;j<=a1;j++){
				if(a1*i==a2*j){
					y=a1*i;
					goto label;
				}
				if(a1*i<a2*j)break;
			}
		}
	label:
		
		printf("%ld %ld\n",x,y);
	}
	return 0;
}