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 {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int a, b, goc;
		while (in.hasNext()) {
			a = in.nextInt();
			b = in.nextInt();
			System.out.print(goc = goc(a, b));
			System.out.print(" ");
			System.out.println(a / goc * b);
		}
	}

	static int goc(int a, int b) {
		if (b != 0) return goc(b, a % b);
		else return a;
	}
}