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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main{
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String str;
		long a,b;


		while((str=br.readLine()) != null){
			a = Long.parseLong(str.substring(0, str.indexOf(" ")));
			b = Long.parseLong(str.substring(str.indexOf(" ")+1, str.length()));

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

		}
	}

	static long gcd(long a,long b){
		return b == 0 ? a : gcd(b,a%b);
	}

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