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

import sys


def gcd(a, b):
    ret = None
    if a <= b:
        large = b
    else:
        large = a
    for i in xrange(large, 0, -1):
        if i == 0 or i == 1:
            continue
        if a % i == 0 and b % i == 0:
            ret = i
            break
    return ret


def lcm(a, b):
    ret = None
    lst = [a, b]
    while True:
        if a == b:
            ret = a
            break
        if a > b:
            b += lst[1]
        else:
            a += lst[0]
    return ret


def main():
    for line in sys.stdin.readlines():
        a, b = [int(n) for n in line.split()]
        print "{0} {1}".format(gcd(a, b), lcm(a, b))


if __name__ == '__main__':
    main()