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.*;
public class Main {

	public void doIt(){
		Scanner sc = new Scanner(System.in);
		while(sc.hasNext()){
			int input1 = sc.nextInt();
			int input2 = sc.nextInt();
			//gcd
			int gcd = gcd(input1, input2);
			//lcm
			int lcm = input1 / gcd * input2;
			System.out.println(gcd + " " + lcm);
		}
	}

	private int gcd(int a, int b){
		if(b == 0) return a;
		else return gcd(b, a % b);
	}

	public static void main(String[] args) {
		Main obj = new Main();
		obj.doIt();
	}

}