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 {
	static Scanner sc = new Scanner(System.in);

	public static void main(String[] args) {
		long a;
		long b;

		while(sc.hasNext()) {
			a = sc.nextInt();
			b = sc.nextInt();

			System.out.println(gcd(a, b) + " " + lcm(a, b));
		}
	}

	public static long gcd(long a, long b) {
		long gcd = a;
		while(b % a != 0) {
			gcd = b % a;
			b = a;
			a = gcd;
		}
		return gcd;
	}

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


}