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.io.IOException;
import java.math.BigInteger;
import java.util.Scanner;

public class Main {

  public static void main(String[] args) throws IOException {
    Scanner scan = new Scanner(System.in);
    while (scan.hasNextLine()) {
      String line = scan.nextLine();
      String[] vals = line.split(" ");
      BigInteger int1 = new BigInteger(vals[0]);
      BigInteger int2 = new BigInteger(vals[1]);

      BigInteger gcd = int1.gcd(int2);

      BigInteger lcm = (int1.multiply(int2)).divide(gcd);
      System.out.println(gcd.toString() + " " + lcm.toString());

    }
  }
}