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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main{
	public static void main(String[] args) throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String line = "";
		while((line = br.readLine()) != null){
			String[] s = line.split(" ");
			long a,b;
			a = Long.parseLong(s[0]);
			b = Long.parseLong(s[1]);
			System.out.println(gcd(a,b) + " " + lcm(a,b));
		}
	}
	
	public static long gcd(long a,long b){
		if(a%b == 0){ return b;}
		else{ return gcd(b,a%b);}
	}
	
	public static long lcm(long a,long b){
		return a*b / gcd(a,b);
	}
}