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: Wrong Answer)

public class Main {

	public static void main(String[] args) {
		// TODO ?????????????????????????????????????????????
		java.util.Scanner sc = new java.util.Scanner(System.in);
		int a = 1;
		int b = 1;
		while ( sc.hasNext() ) {
			a = sc.nextInt();
			b = sc.nextInt();
		}
		System.out.println( gcd(a, b) + " " + lcm(a, b) );
	}

	public static int gcd(int a, int b) {
		int r;
		int max = Math.max(a, b);
		int mini = Math.min(a, b);
		do {
			r = max % mini; // max = q*mini + r , mini > r
			max = mini;
			mini = r;
		} while (r != 0);
		return max;
	}

	public static int lcm(int a, int b) {
		int d = gcd(a, b);
		return a/d * b;
	}
}