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 int calcGCD(int a, int b) {
    if(b > 0) {
      return calcGCD(b, a % b);  
    }   
    else {
      return a;
    }
  }
 
  public static int calcLCM(int a, int b) {
    return ((a / calcGCD(a, b)) * b);
  }

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    while(sc.hasNext()) { 
      int a = sc.nextInt();
      int b = sc.nextInt();
      int gcd = calcGCD(a, b);      
      int lcm = calcLCM(a, b);
      System.out.println(gcd + " " + lcm);
    }    
  }
}