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 int calcGCD(int a_in, int b_in) {
		int a, b;
		if (a_in == b_in) { return a_in;
		} else if (a_in < b_in) { a = b_in; b = a_in;
		} else { a = a_in; b = b_in; }

		int r = a % b;
		if (r == 0) { return b;
		} else { return calcGCD(b, r); }
	}

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		Main m = new Main();

		while (sc.hasNext()) {
			int a = sc.nextInt(), b = sc.nextInt();
			int gcd = m.calcGCD(a, b);
			System.out.println(gcd+" "+(a/gcd*b));
		}

	}
}