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 long euclid (long a, long b) {
	if (b == 0) {
	    return a;
	}
	else {
	    return euclid (b, a%b);
	}
    }
    
    public static void main (String args[]) {
	Scanner scan = new Scanner(System.in);
	long a, b, G, L;

	while (scan.hasNext()) {
	    a = scan.nextLong();
	    b = scan.nextLong();

	    if (a < b) {
		long tmp = a;
		a = b;
		b = tmp;
	    }

	    G = euclid (a, b);
	    L = a*b/G;

	    System.out.println(G+" "+L);
	}
    }
}