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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.lang.reflect.GenericDeclaration;
import java.util.StringTokenizer;

import javax.xml.ws.LogicalMessage;

public class Main {
	
	/*
	 * GCD????????§??¬?´???°?????????????????????????????????????????¨????????????
	 * LCM???????°????????????????GCM?????????????????¨????????????
	*/
	
	public static void main(String[] args) throws IOException {
		// TODO ?????????????????????????????????????????????
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String s = br.readLine();
		StringTokenizer st = new StringTokenizer(s);
		long a,b;
		
		while (s != null) {
			
			a = Long.parseLong(s.substring(0,s.indexOf(" ")));
			b = Long.parseLong(s.substring(s.indexOf(" ") + 1, s.length()));
			
			System.out.println(gcd(a,b) + " " + lcm(a,b));
		}
	}
	
	static long gcd(long a,long b){
		return b == 0 ? a : gcd(b,a%b);
	}
	
	static long lcm(long a,long b){
		return b*a/gcd(a, b);
	}

	
}