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 sc = new Scanner(System.in);
		int GCD[] = new int[100];
		int LCM[] = new int[100];
		int i = 0;
		while(sc.hasNext()){
			int a = sc.nextInt(), b =sc.nextInt();
			GCD[i] = GCD(a,b);
			LCM[i] = (a/GCD[i])*(b/GCD[i])*GCD[i];
			i++;
		}
		for(int j = 0; j < i; j++){
			System.out.println(GCD[j]+" "+LCM[j]);
		}
		
	}
	
	public static int GCD(int a, int b){
		Scanner sc = new Scanner(System.in);
		int x ;
		if(a < b){
			x = a;
			a = b;
			b = x;
		}
		while(true){
			x = a%b;
			if(x == 0) break;
			a = b;
			b = x;
		}
		return b;
	}
}