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) {
		// TODO 自動生成されたメソッド・スタブ

		Scanner sc = new Scanner(System.in);

		double a,b,x,y,GCD,LCM;
		
		int gcd,lcm;

		while (sc.hasNext()) {
						
			a = sc.nextDouble();
			b = sc.nextDouble();

			x = a;
			y = b;

			GCD = a%b;

			while (!(GCD == 0)) {
				a = y;
				b = GCD;
				GCD = a%b;
			}


			gcd = (int)b;

			lcm = (int)((x*y)/gcd);

			System.out.println(gcd+ " " +lcm);
		}
	}
}