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) throws java.io.IOException {
		Scanner scan = new Scanner(System.in);
		long a,b,z,A,B;
		while(scan.hasNext()){
			a = scan.nextInt();
			b = scan.nextInt();
			z = 1;
			A = a;
			B = b;
			while(z != 0){
				z = a % b;
				a = b;
				b = z;
			}
			for(int i = 1 ; i > 0 ; i++){
				if(A*B == a*i){
					System.out.println(a + " " + i);
					break;
				}
			}
		}
	}
}