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 Gcd(int a, int b)
{
	int buf;
	
	if (a < b){
		buf = b;
		b = a;
		a = buf;
	}
	
	if (b == 0) return (a);
	return (Gcd(b, a % b));
}

int main(void)
{
	int a;
	int b;
	int lcm;
	int gcd;
	
	while (1){
		scanf("%d", &a);
		scanf("%d", &b);
		
		if (a == 0 && b == 0){
			break;
		}
		
		gcd = Gcd(a, b);
		
		lcm = (a / gcd) * b;
		
		printf("%d %d\n", gcd, lcm);
	}
	
	return (0);
}