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 {
	private static Scanner scan;
	public static void main(String[] args) {
		scan = new Scanner(System.in);
		while(scan.hasNext()){
			long a = Long.parseLong(scan.next());
			long b = Long.parseLong(scan.next());
			long c = gcd(a,b);
			long d = a*b/c;
			System.out.println(c+" "+d);
		}
		System.exit(0);
	}
	static long gcd(long i ,long j){
		return j == 0 ? i : gcd(j, i % j);
	}
}