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;
import java.util.Date;

class Main{
    public static void main(String[] args){
	Scanner sc = new Scanner(System.in);
	int a,b,c,m,n;
	while(sc.hasNext()){
	    a=sc.nextInt();
	    b=sc.nextInt();
	    m=a;n=b;
	    if(m<n)
		{
		    c=n;
		    n=m;
		    m=c;
		}
	    while(true)
		{
		    if(n==0)break;
		    c=n;
		    n=m%n;
		    m=c;
		}
	   System.out.printf("%d %d\n",m,a/m*b);
	}
    }
}