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.*;

public class Main {
	public static void main(String[] args){
		Scanner sc=new Scanner(System.in);
		while(sc.hasNext()){
			double a=sc.nextDouble();
			double b=sc.nextDouble();
			System.out.printf("%.0f %.0f\n",GCD(a,b),LCM(a,b));
		}
	}
	static double GCD(double x,double y){
		double g=0;
		if(y==0){
			g=x;
		}else{
			g=GCD(y,x%y);
		}
		return g;
	}
	static double LCM(double x,double y){
		return x*y/GCD(x,y);
	}
	
}