Problem:
GCD and LCM

Write a program which computes the greatest common divisor (GCD) and the least common multiple (LCM) of given a and b.

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.

Constraints

0 < a, b ≤ 2,000,000,000

LCM(a, b) ≤ 2,000,000,000

The number of data sets ≤ 50

Output

For each data set, print GCD and LCM separated by a single space in a line.

Sample Input

8 6
50000000 30000000

Output for the Sample Input

2 24
10000000 150000000

Solution in JAVA (judge verdict: Accepted)

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;

class Main {

  static long gcd(long a, long b) {
    return b == 0 ? a : gcd(b, a%b);
  }

  static long lcm(long t, long ab) {
    return ab / t;
  }

  public static void main(String[] args) throws IOException {
    long a, b, t;
    BufferedReader buf = new BufferedReader(new InputStreamReader(System.in));
    String str;
    String[] array = new String[2];
    while ((str = buf.readLine()) != null) {
      array = str.split(" ");
      a = Long.parseLong(array[0]);
      b = Long.parseLong(array[1]);
      t = gcd(a, b);
      System.out.println(t + " " + lcm(t, a*b));
    }
  }
}