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){
	int a, b, n, a1, a2, b1;
	int i;
	int c, d;	//最大公約数,最小公倍数

	while (scanf("%d %d", &a, &b) != EOF){		//Ctrl+Zが押されるまで繰り返す
		if (a < b){		//a>bになるように入れ替える
			n = a; a = b; b = n;
		}


		for (i = a; i>0; i--){		//最大公約数を求める
			if (a / i == (double)a / (double)i){
				if (b / i == (double)b / (double)i){
					c = i;
					break;
				}
			}
		}
		i = 1;
		while (1){		//最小公倍数を求める
			if (a*i / b == (double)a*i / (double)b){
				d = i;
				break;
			}
			i++;
		}
		printf("%d %d\n", c, a*d);
	}

	return 0;

}