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 Scala (judge verdict: Accepted)

object Main extends App {

  def gcd(i: Long, reminder: Long): Long =
    if (reminder == 0) i else gcd(reminder, i % reminder)

  def lcm(n: Long, m: Long): Long = (n*m) / gcd(m, n)

  for (str <- io.Source.stdin.getLines) {
    val Array(n, m) = str.split(" ").map(_.toLong)
    println(s"${gcd(n, m)} ${lcm(n, m)}")
  }
}