405048: GYM101755 A Restoring Numbers

Pavel had two positive integers a and b. He found their sum s and greatest common divisor g, and forgot a and b after that. Help him to restore the original numbers.

A single line contains two integers s and g (1 ≤ s ≤ 10⁹, 1 ≤ g ≤ 10⁹) — sum and greatest common divisor of the numbers a and b.

If Pavel made a mistake and there are no such numbers a and b, output a single number  - 1.

Otherwise, output two positive integers a and b on a single line, separated by a space. If there are multiple possible solutions, output any of them.

6 2

4 2

7 2

-1