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)

public class
Main
{
  public static int
  gcd (
    int a,
    int b
    )
  {
    if ( a == 0 ) return ( b );

    return
    gcd ( b % a, a );
  }

  public static void
  main (
    String[ ] args
    )
  {
    java.util.Scanner cin = new java.util.Scanner ( System.in );

    while ( cin.hasNext ( ) )
    {
      int a, b;

      a = cin.nextInt ( ); b = cin.nextInt ( );
      System.out.println ( gcd ( a, b ) + " " + a / gcd ( a, b ) * b );
    }

    return ;
  }
}