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 args[]){
		Scanner sc = new Scanner(System.in);
		long num1,num2,gc1,gc2,lc1,lc2;

		while(sc.hasNextInt()){
			num1 = sc.nextInt();
			num2 = sc.nextInt();
			if(num1 >= num2){
				gc1 = num1;gc2 = num2;
				lc1 = num1;lc2 = num2;
			}else{
				gc1 = num2;gc2 = num1;
				lc1 = num2;lc2 = num1;
			}						//xx1?????§?????????xx2????°??????????????????£??\???
			long GCD,LCM;
			while(gc1 % gc2 != 0){
				GCD = gc1 % gc2;
				gc1 = gc2;
				gc2 = GCD;
			}
			LCM = (lc1*lc2)/gc2;
			System.out.println(gc2 + " " + LCM);
		}
		sc.close();
	}
}