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 stdIn = new Scanner(System.in);
		while (stdIn.hasNext()) {
			long a = stdIn.nextLong();
			long b = stdIn.nextLong();
			long c = 0;
			long d = a * b;
			if (a < b) {
				outside: for (;;) {
					c = b % a;
					if (c == 0)
						break outside;
					b = a;
					a = c;

				}
				c = a;
			} else {
				outside: for (;;) {
					c = a % b;
					if (c == 0)
						break outside;
					a = b;
					b = c;

				}
				c = b;
			}
			System.out.println(c + " " + d/c);
		}
	}
}