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.Math;
import java.math.BigInteger;

class Main {
    public static void main (String [] args) {

        Scanner sc = new Scanner(System.in);

        BigInteger a, b;

        while (true) {
            try {
               a = new BigInteger(sc.next());
               b = new BigInteger(sc.next());
            } catch (NoSuchElementException e) {
               break;
            }

            BigInteger g = a.gcd(b);
           System.out.printf("%d %d\n", g, a.divide(g).multiply(b)); 
        }
    }
}