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);
		while(sc.hasNext()){
			int a=sc.nextInt();
			int b=sc.nextInt();
			System.out.println(gcd(a,b));
			System.out.println(lcm(a,b));
		}
	}

	private static int gcd(int a,int b){
		int max=Math.max(a, b);
		int min=Math.min(a, b);

		int amari=max%min;
		if(amari==0)return min;
		return gcd(min,amari);
	}

	private static int lcm(int a,int b){
		return a*b/gcd(a,b);
	}
}