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)
{
	unsigned long a, b;
	unsigned long i;
	unsigned long Max = 0;
	unsigned long Min = 0;
	
	while (scanf("%d %d", &a, &b) != EOF){
		for (i = 1; Min == 0; i++){
			if (i <= a || i <= b){
				if (a % i == 0 && b % i == 0){
					Max = i;
				}
			}
			if (i >= a || i >= i){
				if (i % a == 0 && i % b == 0){
					Min = i;
				}
			}
		}
		printf("%d %d\n", Max, Min);
		Max = 0;
		Min = 0;
	}
	
	return (0);
}