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;

class Main{
	public static void main(String args[]){
		Scanner scan = new Scanner(System.in);
		int i;
		int GCD,LCM;
		double[] num = new double[2];
		double[] tmpNum = new double[2];
		double tmp;
		
		while(scan.hasNextInt()){
			for(i=0;i<2;i++){
				num[i] = scan.nextInt();
				tmpNum[i] = num[i];
			}
			
			
			while(num[1] != 0){
				if(num[0] < num[1]){
					tmp = num[0];
					num[0] = num[1];
					num[1] = tmp;
				}
				
				tmp = num[0] - num[1];
				num[0] = num[1];
				num[1] = tmp;
			}
			GCD = (int)num[0];
			LCM = (int)((tmpNum[0]*tmpNum[1])/GCD);
			
			System.out.println(GCD + " " + LCM);
		}
		
		scan.close();
	}
}