GCD and LCM

Easy#math #number-theory· solved by 0 · time limit 2.0 s

Print the greatest common divisor and the least common multiple of $a$ and $b$ .

Hint: Euclid's algorithm — $\gcd(a, b) = \gcd(b, a \bmod b)$ — and $\text{lcm}(a,b) = a / \gcd(a,b) \times b$ .

Input

Two positive integers $a$ and $b$ .

$\gcd$ and $\text{lcm}$ separated by a space.

$1 \le a, b \le 10^9$ — the LCM can need 64 bits.

Input

12 18

Output

6 36

Input

7 5

Output

1 35