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 sc = new Scanner(System.in);
		long a,b,g,l;
		while(sc.hasNext())
		{
			a = sc.nextLong();
			b = sc.nextLong();
			g = gcd(a,b);
			l = (a*b)/g;
			System.out.println(g + " " + l);
		}
	}

	private static long gcd(long a, long b) {
		if(a==0) return b;
		else if(b==0) return a;
		return gcd(b,a%b);
	}
}