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 int gcd(int m, int n) {
		if(n ==0){
			return m;
		}else{
			return gcd(n,m%n);
		}
	}
	public static long lcm(int m, int n){
		return (m / gcd(m, n)) * n; 
	}
    public static void main(String[] a){
    	
    	Scanner scan = new Scanner(System.in);
    	while (scan.hasNext()){ 
    	int n = 0;
    	int m = 0;
    	m = scan.nextInt();
    	n = scan.nextInt();
    	System.out.print(gcd(m,n) + " ");
    	System.out.println(lcm(m,n));
    	
    	}
 }
}