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 scn = new Scanner(System.in);
		while(scn.hasNext())
		{
			int a = scn.nextInt();
			int b = scn.nextInt();
			System.out.printf("%d %d\n", getCommonDivider(a, b), getCommonMultiplier(a, b));
		}
	}

	public static int getCommonDivider(int a, int b)
	{
		if (b == 0) return a;
		int q = a % b;
		return getCommonDivider(b, q);
	}

	public static int getCommonMultiplier(int a, int b)
	{
		int v = getCommonDivider(a, b);
		int va = a / v;
		int vb = b / v;
		return v*(va*vb);
	}
}