There are two plates with fruits. Two players play in turns the following game: On each turn player can choose any plate and eat as many fruits from it as he want. The first player who cannot do that loses and washes dishes. Given the number of fruits in both plates, determine what move should first player do in order to win, assuming that second player plays optimally. Input data specification The only line of input contains two numbers: number of fruits in the first plate and number of fruits in the second plate. Output data specification If it is impossible to win, output the only number -1. Otherwise output number of fruits in the first plate and number of fruits in the second plate after first player's move. Sample input 1 5 3 Sample output 1 3 3 Sample input 2 4 4 Sample output 2 -1