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: Time Limit Exceeded)

import java.util.Scanner;
import java.util.Arrays;

class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		
		while( scan.hasNextInt() ) {
			Integer[] ary = new Integer[2];
			ary[0] = scan.nextInt();
			ary[1] = scan.nextInt();
			
			Arrays.sort(ary);
			
			int divisor = 1, multiple = 1;
			
			for(int i = 1; i <= ary[0]; i++) {
				if((ary[0] % i == 0) && (ary[1] % i == 0)) {
					divisor = i;
				}
			}
			
			for(int i = ary[1]; ; i++) { 
				if((i % ary[0] == 0) && (i % ary[1] == 0)) {
					multiple = i;
					break;
				}
			}
			
			System.out.println(divisor + " " + multiple);
		}
	}
}