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;
public class Main{
	public static void main(String[] args){
		Scanner sc=new Scanner(System.in);
		while(sc.hasNextInt()){
			int a=sc.nextInt();
			int b=sc.nextInt();
			System.out.println(gcd(a,b)+" "+lcm(a,b));
		}
		sc.close();
	}
	static int gcd(int a,int b){
		int c=Math.max(a, b);
		int d=Math.min(a, b);
		while(c%d!=0){
			int e=c%d;
			c=d;
			d=e;
		}
		return d;
	}
	static int lcm(int a,int b){
		int gcd=gcd(a,b);
		int resa=a/gcd;
		int resb=b/gcd;
		int lcm=resa*resb*gcd;
		return lcm;
	}
}