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.*;

public class Main {
	private static Scanner sc;
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		int gcd, lcm;
		
		while(sc.hasNext()){
			int a = sc.nextInt();
			int b = sc.nextInt();
			int a2 = a;
			int b2 = b;
			
			while(true){
				if(a2 == b2) break;
				if(a2 > b2){
					a2 -= b2;
				}else{
					b2 -= a2;
				}
			}
				
				gcd = a2;
				lcm = a * b / gcd;
				
				System.out.println(gcd+" "+lcm);
		}
	}
}