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.*;
public class Main {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		long a1, b1, r1, r2, temp, a2, b2;

		while(scan.hasNext()){
			a1 = scan.nextInt();
			a2 = a1;
			b1 = scan.nextInt();
			b2 = b1;
			while(a2 % b2 != 0){
				if(a2 < b2){
					temp = a2;
					a2 = b2;
					b2 = temp;
				}
				a2 = a2 % b2;
			}
			r1 = b2;
			r2 = (a1*b1) / r1;
			System.out.println(r1+" "+r2);
		}
	}

}