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.NoSuchElementException;
import java.util.Scanner;

public class Main {
	private static Scanner sc;
	static int getGCD(int a,int b){
		if(b>a){
			int tmp=a;
			a=b;
			b=tmp;
		}
		while(b!=0){
			int tmp=b;
			b=a%b;
			a=tmp;
		}
		return a;
	}
	static int getLCM(int a,int b){
		return a/getGCD(a,b)*b;
	}
	public static void main(String[] args){
		sc=new Scanner(System.in);
		while(true){
			try{
				int a=sc.nextInt();
				int b=sc.nextInt();
				System.out.print(getGCD(a,b)+" ");
				System.out.println(getLCM(a,b));
			}catch(NoSuchElementException e){
				break;
			}
		}
	}

}