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;
class Main{
	public static void main(String[] args){
		Scanner scan = new Scanner(System.in);
		int a=0,b=0,m=0,n=0,t=0;
		while(scan.hasNext()){
			a = scan.nextInt();
			b = scan.nextInt();
			if(a < b){
				m = b;
				n = a;
			}else{
				m = a;
				n = b;
			}
			while(true){
				if((t=m % n) == 0){
					break;
				}
				m = n;
				n = t;
			}
			System.out.println(n + " " + a/n*b);
		}
	}
}