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.*;
import java.io.*;
import java.math.*;



public class Main {
	
	private static long gcd(long n, long m) {
//		int tmp = 0;
		while(n != m) {
			if(n > m) {
				n -= m;
			}
			else {
				m-= n;
			}
		}
		
		
		return n;
	}

//	private static int lcm(int n, int m) {
//		return n*m/gcd(n,  m);
//	}
	
	public static void main(String[] args) throws IOException{
        Scanner scan = new Scanner(System.in);
        while(scan.hasNext()) {
        	long n = scan.nextInt();
        	long m = scan.nextInt();
        	long gcd = gcd(n, m);
        	System.out.println(gcd + " " + n * m / gcd);
        	
        }

        
	}
}
 