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.hasNextInt()){
			int a=sc.nextInt();
			int b=sc.nextInt();
			System.out.println(gcd(a,b)+" "+lcm(a,b));
		}
		sc.close();
	}
	
	static int gcd(long a,long b){	//最大公約数
		if(a<b) return gcd(b,a);	//入れ換えて再実行
		long d=0;
		do{
			d=a%b;
			a=b;
			b=d;
		}while(d!=0);
		return (int)a;
	}

	static int lcm(long a,long b){	//最小公倍数
		return (int)(a*b/gcd(a,b));
	}
}