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.*;
import java.lang.*;
import java.io.*;

public class Main{
	public static void main (String[] args) throws java.lang.Exception{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String line = br.readLine();
	    while(line!=null){
	        String[] lines = line.split(" ");
    	    long a = Integer.parseInt(lines[0]);
    	    long b = Integer.parseInt(lines[1]);
    	    long tmp_a = a;
    	    long tmp_b = b;
    	    
    	    if(a<b){
    	        long tmp = a;
    	        a = b;
    	        b = tmp;
    	    }
    	    long r=a%b;
    	    while(r!=0){
    	        a=b;
    	        b=r;
    	        r=a%b;
    	    }
    	    long GCD = b;
    	    System.out.print(GCD);
    	    System.out.print(" ");
    	    System.out.println((tmp_a*tmp_b)/GCD);
	        line = br.readLine();
	    }
	}
}