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;

class Main {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        while (scan.hasNext()) {

            long a = scan.nextLong();
            long b = scan.nextLong();
            long X = a;
            long Y = b;
            long Z;

            while (X % Y != 0) {
                Z = X;
                X = Y;
                Y = Z % Y;
            }
            System.out.println(Y + " " + a / Y * b);
        }
    }
}

