You are given two positive numbers $a$ and $b$. Calculate two positive numbers $x$ and $y$ such that:

• $x \le y$
• gcd($a$, $b$) $=$ gcd($x$, $y$)
• lcm($a$, $b$) $=$ lcm($x$, $y$)
• $y - x$ is minimal among all such pairs of ($x$, $y$)

Input

The first line contains two positive numbers $a$ and $b$.

Output

Output two positive numbers $x$ and $y$ ($1 \le x \le y$) such that gcd($a$, $b$) $=$ gcd($x$, $y$), lcm($a$, $b$) $=$ lcm($x$, $y$) and $y - x$ is minimal.

Constraints

$1 \le a, b \le 10^9$

Example

Input:

3 4

Output:

3 4

Input:

1 12

Output:

3 4