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 {

	public static void main(String[] args) {
		// TODO ?????????????????????????????????????????????
		Scanner s = new Scanner(System.in);
		int max,min;
		int a,b;
		
	int counter = 0;
		while(s.hasNext()){
			
			a = s.nextInt();
			b = s.nextInt();
			int x = a;
			int y = b;
			while(x!=y){
				if(x>y){
					y += b;
				}else{
					x += a;
				}
			}
			min = x;
			max = (int)((long)a * b / min);
			System.out.println(max+" "+min);

		}
	}
}