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 {
	Scanner sc = new Scanner(System.in);
	
	void run(){
		while(sc.hasNext()){
			long a, ta, b, tb, gcd, lcm;
			a = ta = sc.nextLong();
			b = tb = sc.nextLong();
			gcd = lcm = 1;
			
			int d = 2;
			
			
			while(true){
				if(ta / d == 0 || tb / d == 0)
					break;
				
				if(ta % d == 0 && tb % d == 0){
					gcd *= d;
					ta /= d;
					tb /= d;
				}else{
					d++;
				}
			}
			
			lcm = a * b / gcd;
			
			System.out.printf("%d %d\n", gcd, lcm);
		}
	}
	
	public static void main(String[] args) {
		new Main().run();
	}
}