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.util.Scanner;

public class Main {
	public static void main(String[] a){
		Scanner scn = new Scanner(System.in);
		try{
			while(true){
				long alpha = scn.nextInt();
				long beta = scn.nextInt();
				long gcd = gcd(alpha,beta);
				long lcm = alpha /gcd * beta;
				System.out.println(gcd + " " + lcm);
			}
		}catch(Exception e){

		}

	}
	public static long gcd(long alpha,long beta){
		long x = Math.max(alpha,beta);
		long y = Math.min(alpha,beta);
		long z;
		while(y != 0){
			z = y;
			y = x % y;
			x = z;
		}
		return x;
	}
}