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;
class Main{
	public static void main(String[] a){
		Scanner scan = new Scanner(System.in);
		while(scan.hasNext()){
			int num1 = scan.nextInt(), num2 = scan.nextInt();
			if(num1 < num2){
				int sub = num1;
				num1 = num2;
				num2 = sub;
			}
			int div = euclid(num1, num2);
			System.out.println(div + " " + num1 / div * num2);
		}
	}
	static int euclid(int num1, int num2){
		if(num1 % num2 == 0) return num2;
		return euclid(num2, num1 % num2);
	}
}