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.io.BufferedInputStream;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(new BufferedInputStream(System.in));
		long a, b;
		while (scanner.hasNext()) {
			a = scanner.nextLong();
			b = scanner.nextLong();
			long gcd = gcd(a, b);
			System.out.println(gcd + " " + lcm(a, b, gcd));

		}
	}

	public static long gcd(long a, long b) {
		long max = Math.max(a, b);
		long min = Math.min(a, b);
		if (max % min == 0)
			return min;
		return gcd(min, max % min);
	}

	public static long lcm(long a, long b, long gcd) {
		return a * b / gcd;
	}
}