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 {

    static int gcd(int a, int b){
	if(a < b){
	    int temp = a;
	    a = b;
	    b = temp;
	}
	
	while(b != 0){
	    int temp = b;
	    b = a % b;
	    a = temp;
	}
	return a;	    
    }

    static int lcm(int a, int b){
	a /= gcd(a, b);
	return a * b;
    }
    
    public static void main(String[] args){
	Scanner stdin = new Scanner(System.in);
	while(stdin.hasNextInt()){
	    int a = stdin.nextInt();
	    int b = stdin.nextInt();
	    System.out.println(gcd(a, b) + " " + lcm(a, b));
	}
    }
}