GCD and LCM

Seryozha loves math problems. Recently at a math club he learned what the GCD and LCM are.

The GCD of two positive integers $a$ and $b$ is their greatest common divisor, that is, the largest number $x$ such that $a$ is divisible by $x$ and $b$ is divisible by $x$. For example, $\gcd(24, 18)=6$. The LCM of two integers $a$ and $b$ is their least common multiple, that is, the smallest number $x$ such that $x$ is divisible by $a$ and $x$ is divisible by $b$. For example, $\operatorname{lcm}(24, 18)=72$.

Seryozha immediately noticed that several pairs of numbers can have the same GCD and LCM. Now he is interested in the following question: given numbers $a$ and $b$, how close to each other can two numbers be if they have the same GCD and LCM?

Given two numbers $a$ and $b$, find numbers $x$ and $y$ such that $\gcd(a, b)=\gcd(x, y)$, $\operatorname{lcm}(a, b)=\operatorname{lcm}(x, y)$, and their difference $y-x$ is minimal.

The first line of the input file contains two positive integers $a$ and $b$ ($1 \le a \le b \le 10^9$).

Output two positive integers $x$ and $y$ ($1 \le x \le y$) such that $\gcd(a, b)=\gcd(x, y)$, $\operatorname{lcm}(a, b)=\operatorname{lcm}(x, y)$, and their difference $y-x$ is minimal.