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.math.BigInteger;
import java.util.Scanner;

public class Main
{
	public static void main(String arg[])
	{
		Scanner sc = new Scanner(System.in); 
		while(sc.hasNext())
		{
		
		BigInteger x = sc.nextBigInteger();
		BigInteger y = sc.nextBigInteger();

		BigInteger gcd = x.gcd(y);
		BigInteger lcm = x.multiply(y).divide(gcd);
		System.out.print(gcd+" ");
		System.out.println(lcm);
		}
	}
	/*public static int  gcd(int x, int y) //ユークリッド互除法
	{
		int div=-1;
		while(true)
		{
			div = x%y;
			if(div==0)
				break;
			x=y;
			y=div;
		}	
		return y;
	}
	 */


}