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.*;
import java.math.*;
public class Main {
	static Scanner sc = new Scanner(System.in);
	static BigInteger a, b;
	public static void main(String[] args) {
		while(read()){
			solve();
		}

	}
	static boolean read(){
		if(!sc.hasNext())
			return false;
		a = sc.nextBigInteger();
		b = sc.nextBigInteger();
		return true;
	}
	static void solve(){
		System.out.print(gcd(a, b) + " ");
		System.out.println(lcm(a, b, gcd(a, b)));
	}
	static BigInteger gcd(BigInteger a, BigInteger b){
		return a.gcd(b);
	}
	static BigInteger lcm(BigInteger a, BigInteger b, BigInteger gcd){
		return a.multiply(b).divide(gcd);
	}
}