AcatwearsahatifandonlyifithasN catsinitshat. There is exactly one cat that is not inside any other cat’s hat. If there are M cats without hats, how many cats are there? Input Input consists of several test cases. For each case, there would be two integers, N and M, where 1 ≤ N < 100000 and 1 ≤ M < 100000. The input ends with a case where N = 0. You must not process this test case. Output For each test case, print N and M. Then if the total number of cats can be expressible uniquely in an integer, print the number. If the case is impossible print the word ‘Impossible’ without quotes. If there are multiple answers, print the word ‘Multiple’ without the quotes. Sample Input 25 34 33 00 Sample Output 259 3 4 Impossible 334