Write a program which computes the greatest common divisor (GCD) and the least common multiple (LCM) of given a and b.

Constraints

* 0 < a, b ≤ 2,000,000,000
* LCM(a, b) ≤ 2,000,000,000
* The number of data sets ≤ 50

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.

Output

For each data set, print GCD and LCM separated by a single space in a line.

Example

Input

8 6
50000000 30000000


Output

2 24
10000000 150000000
import java.io.*;
import java.util.*;
import java.math.*;


public class Main
{

public static long GCD(long a, long b){
	if(b == 0) return a;
	else return GCD(b, a%b);
}

public static long LCM(long a, long b){
	return (a * b)/GCD(a, b);
}




 public static void main(String args[]) throws Exception
       {
       	Scanner cin = new Scanner(System.in);
       	while(cin.hasNext()){
       		long a = cin.nextLong();
       		long b = cin.nextLong();
       		//System.out.println(GCD(a, b));
       		System.out.println( GCD(a, b) + " " + LCM(a, b));
       	}

}
}