#65Easy

GCD and LCM

Time: 1 s · Memory: 256 MB

Statement

You are given natural numbers $a$ and $b$ . Find their greatest common divisor (GCD) and least common multiple (LCM).

A single line with two integers $a$ and $b$ ( $1 \le a, b \le 10^9$ ).

A single line with two numbers: the GCD and the LCM.

Input

24 18

Output

6 72

Input

17 37

Output

1 629

Euclid's algorithm: $\text{GCD}(a, b) = \text{GCD}(b, a \bmod b)$ , $\text{GCD}(a, 0) = a$ . Then — divide first, then multiply.