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 scan = new Scanner(System.in);
		long[] ab = new long[2];
		long a,b;
		long gcd = 0;
		long lcm = 0;

		while ((scan.hasNext())) {
			a = Integer.parseInt(scan.next());
			b = Integer.parseInt(scan.next());

			ab[0] = a;
			ab[1] = b;

			java.util.Arrays.sort(ab);

			while(ab[0] != 0){
				long pool = ab[0];
				ab[0] = ab[1] % ab[0];
				ab[1] = pool;
			}
			gcd = ab[1];


			// Å¬ö{
			lcm = a * b / gcd;
			System.out.println(gcd+" "+lcm);
		}
	}
}