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 {
	@SuppressWarnings("resource")
	public static void main(String[] args){
		Scanner sc  = new Scanner(System.in);
		
		while(sc.hasNextLine()){
			//double preX,preY;
			String[] s = sc.nextLine().split("[\\s]+");
			long[] data = new long[s.length];
			for(int i=0;i<s.length;i++){
				data[i] = Long.parseLong(s[i]);
			}
			
			System.out.println(gcd(data[0],data[1])+" "+lcm(data[0],data[1]));
			
		}
	}
	
	public static long gcd(long a,long b){
		return b==0 ? a : gcd(b,a%b);
	}
	
	public static long lcm(long a,long b){
		return a*b / gcd(a,b);
	}
}