Frankfurt UAS Exercises Week 4

Start

2018-05-03 18:00 UTC

Frankfurt UAS Exercises Week 4

End

2018-05-10 18:00 UTC
The end is near!
Contest is over.
Not yet started.
Contest is starting in -320 days 4:41:38

Time elapsed

168:00:00

Time remaining

0:00:00

Problem G
Boastin' Red Socks

You have a drawer that is full of two kinds of socks: red and black. You know that there are at least $2$ socks, and not more than $50\, 000$. However, you do not know how many there actually are, nor do you know how many are red, or how many are black.

You have noticed, though, that when you reach into the drawer each morning and choose two socks to wear (in pitch darkness, so you cannot distinguish red from black), the probability that you pick two red socks is exactly $p/q$, where $0 < q$ and $0 \le p \le q$.

From this, can you determine how many socks of each colour are in your drawer? There may be multiple solutions – if so, pick the solution with the fewest total number of socks, but still allowing you to wear a couple of same color socks.

Input

Input consists of multiple problems, each on a separate line. Each problem consists of the integers $p$ and $q$ separated by a single space. You may assume that $p$ and $q$ will both fit into an unsigned 32-bit integer.

Input is terminated by a line consisting of two zeroes.

Output

For each problem, output a single line consisting of the number of red socks and the number of black socks in your drawer, separated by one space. If there is no solution to the problem, print “impossible”.

Sample Input 1 Sample Output 1
1 2
6 8
12 2499550020
56 789
0 0
3 1
7 1
4 49992
impossible