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.*;

class Main {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);

        while (input.hasNext()) {
            int a = input.nextInt();
            int b = input.nextInt();
            int gcd = GCD(a, b);
            int lcm = a / gcd * b;

            System.out.println(gcd + " " + lcm);
        }
    }
    
    public static int GCD (int a, int b) {
        if (b == 0) {
            return a;
        }
        return GCD(b, a % b);
    }
}