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(void)
{
	long int a,b,c,d;
	int i=2,j=0,k=0,l=0,o=0,jj=0;
	int u=1;

	while(scanf("%ld",&a)&&scanf("%ld",&b) != EOF)
	{
		c = a;
		d = b;
		while(i < c && i < d)
		{
			if(a%i == 0 && b%i == 0)
			{
				a = a/i;	b = b/i;
				u = u * i;
				i = 2;
			}
			else
			{
				i++;
			}
		}
		printf("%d ",u);
		
		j = u*a*b;
		printf("%d\n",j);
		k=0;o=0;u=1,i=2;
	}

	return 0;
}