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.*;
class Main{
    int gcd(int p, int q){
	return q==0?p:gcd(q,p%q);
    }

    void ruun(){
	Scanner sc = new Scanner(System.in);
	int x, y, z;
	while(sc.hasNext()){
	    x = sc.nextInt();
	    y= sc.nextInt();
	    z = gcd(Math.max(x,y), Math.min(x,y));
	    System.out.println(z+" "+x/z*y);
	}
    }

    public static void main(String[] args){
	new Main().ruun();
    }
}