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 C (judge verdict: Time Limit Exceeded)

#include <stdio.h>

int main(int argc, const char * argv[])
{
    long a, b, x, y;

    while (scanf("%ld %ld", &a, &b) != EOF){
        if (a <= b) {
            for (x=a; (0!=a%x)||(0!=b%x); x--);
            for (y=b*2; 0!=y%a; y+=b);
        } else {
            for (x=b; (0!=a%x)||(0!=b%x); x--);
            for (y=a*2; 0!=y%b; y+=a);
        }
        printf("%ld %ld\n",x,y);
    }
    return 0;
}