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,i,gcd,lcm,max;
	while((scanf("%d %d",&a,&b) != EOF))
	{
		max = a; if(b>a)max=b;
		for(i=max;i>0;i--)
		{
			if(b%i==0 && a%i==0){gcd = i;break;}
		}
		lcm = a/gcd*b;
		printf("%d %d\n",gcd,lcm);
	}
	
	return 0;
}