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

class Main {
	public static void main(String a[]){
		Scanner scanner = new Scanner(System.in);
		int n1;
		int n2;
		while(scanner.hasNext()){

			n1 = scanner.nextInt();
			n2 = scanner.nextInt();

			System.out.println(gcd(n1,n2) + " " + lcm(n1,n2));
		}
		scanner.close();
	}

	public static int gcd(int a, int b ){
		if(b>a){
			int k = a;
			a = b;
			b = k;
		}
		while(a%b != 0){
			int t = a%b;
			a = b;
			b = t;
		}
		return b;
	}
	

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

}