Monocarp is a great solver of adhoc problems. Recently, he participated in an Educational Codeforces Round, and gained rating! Monocarp knew that, before the round, his rating was a . After the round, it increased to b ( b > a ). He wrote both values one after another to not forget them. However, he wrote them so close to each other, that he can't tell now where the first value ends and the second value starts. Please, help him find some values a and b such that: If there are multiple answers, you can print any of them. The first line contains a single integer t ( 1 <= t <= 10^4 ) -- the number of testcases. The only line of each testcase consists of a single string ab of length from 2 to 8 that: For each testcase, determine if such values a and b exist. If they don't, print -1. Otherwise, print two integers a and b . If there are multiple answers, you can print any of them. In the second testcase, printing 3 and 91125 is also valid. In the third testcase, 20 and 0200 is not valid, because b has a leading zero. 200 and 200 is not valid, because 200 is not strictly greater than 200 .