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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
	public static void main(String[] args) throws NumberFormatException, IOException {
		long 			x, y, origX, origY;
		String			buffer;
		BufferedReader 	reader = new BufferedReader(new InputStreamReader(System.in));

		while((buffer = reader.readLine()) != null){
			x = Long.parseLong(buffer.split(" ")[0]);
			y = Long.parseLong(buffer.split(" ")[1]);

			origX = x;
			origY = y;

			if(x < y){
				long tmp = x;
				x = y;
				y = tmp;
			}

			long mod;
			while((mod = x % y) != 0){
				x = y;
				y = mod;
			}

			System.out.println(y + " " + (origX * origY / y));
		}


	}

}