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.*;
import java.lang.*;
import java.math.*;

public class Main {
	
	Scanner sc = new Scanner(System.in);
	
	void run() {
		
		long x,y,z;
		long first,second;
		long tmp;
		
		while (sc.hasNext()) {
			
			first = sc.nextLong();
			second = sc.nextLong();
			
			x = first;
			y = second;
			
			if (x<y) {
				tmp = x;
				x = y;
				y = tmp;
			}
			
			do {
				z = x % y;
				x = y;
				y = z;
			} while (z!=0);
			
			System.out.println(x + " " + first * second / x );
			
		}
		
	}
	
	public static void main(String[] args) {
		
		new Main().run();
		
	}
}