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 int GCD(int a,int b) {
		int c;
		while(a%b!=0) {
			c = a%b;
			a = b;
			b = c;
		}
		return b;
	}
	public static int LCM(int a,int b) {
		return a/GCD(a,b)*b;
	}
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int x,y;    //变量
		while(in.hasNext()) {
			x = in.nextInt();
			y = in.nextInt();
			System.out.println(GCD(x,y)+" "+LCM(x,y));
		}
		in.close();
	}
}
