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{
	
	static Scanner sc = new Scanner(System.in);
	static long a, b, tmp, max, min, mod, x, y;

	public static void main(String[] args) {
		
		while(read()){
			solve_max();
			solve_min();
			System.out.println(max + " " + min);
		}
	}
	
	public static boolean read(){
		if(!sc.hasNext()) return false;
			
		a = sc.nextInt();
		b = sc.nextInt();
		
		if(a < b){
			tmp = a;
			a = b;
			b = tmp;
		}
		
		return true;
	}
	
	public static void solve_max(){
		
		x = a;
		y = b;
		
		while((mod = (x % y)) != 0){
			x = y;
			y = mod;
		}
		
		max = y;
	}
	
	public static void solve_min(){
		min = (a * b) / max;
	}

}