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 JAVA (judge verdict: Accepted)

import java.util.Scanner;


public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner scanner = new Scanner(System.in);

		long a, b, m, n,tmp;

		while(scanner.hasNext()){
			a = m = scanner.nextInt();
			b = n = scanner.nextInt();
			if(m < n){
				tmp = m;
				m = n;
				n = tmp;
			}

			for(;;){
				if(n == 0) break;

				tmp = n;
				n = m % n;
				m = tmp;
			}

			System.out.println(m +" " + a * b / m);

		}
	}
}