Compute the greatest common divisor and least common multiple of \(a\) and \(b\).

Input

One line containing \(a\) and \(b\).

The input satisfies:

• \(1 \le a, b \le 10^12\)
• The LCM fits in a signed 64-bit integer.

Output

Print the GCD followed by the LCM, separated by one space.

Example

Input

24416 59870

Output

2 730892960