You are given a string S which represents a number. You have to find the smallest number strictly greater than the given number which contains the same set of digits as of the original number i.e the frequency of each digit from 0 to 9 should be exactly the same as in the original number.
If the given string is 56789, then the next greater number is 56798. Note that although 56790 is also greater than the given number it contains 1 '0' which is not in the original number and also it does not contain the digit '8'.
The given string is non-empty.
If the answer does not exist, then return -1.
The given number does not contain any leading zeros.
The first line of the input contains an integer T denoting the number of test cases.
The first and the only line of each test case contains a string S representing the number.
The only line of output of each test case should print the number which is just greater than the given number as described above
You do not need to print anything, it has already been taken care of. Just implement the given function.
1 <= T <= 100
1 <= len(S) <= 10^4
Time Limit: 1 sec