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)

import java.util.Scanner;


public class Main{
	
	public static void main(String[] args){
		
		Scanner sc = new Scanner(System.in);
		long a, b;
		while(sc.hasNext()) {
			a = sc.nextLong();
			b = sc.nextLong();
			System.out.println(LCM(a, b) + " " + GCD(a, b));
		}
		sc.close();
	}
	
	static long GCD(long a, long b) {
		return a * b / LCM(a, b);
	}
	
	static long LCM(long a, long b) {
		long n0 = (a >= b) ? a: b;
		long n1 = (a >= b) ? b: a;
		
		if(n1 == 0) return n0;
		else return LCM(b, n0 % n1);
	}
}