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.math.BigInteger;
import java.util.ArrayList;
import java.util.Scanner;

public class Main {
	static ArrayList<String> allpermutations;
	public static void main(String[] args){
		Scanner cin = new Scanner(System.in);
		long a;
		long b;
		BigInteger aVal;
		BigInteger bVal;
		BigInteger gcd;
		BigInteger lcm;
		while(cin.hasNextLong()){
			a = cin.nextLong();
			b = cin.nextLong();
			aVal = BigInteger.valueOf(a);
			bVal = BigInteger.valueOf(b);
			gcd = aVal.gcd(bVal);
			lcm = (aVal.multiply(bVal)).divide(gcd);
			System.out.println(gcd + " " + lcm);
		}
	}
}