Please enter your email address or userHandle.
Given a number n, find the smallest number that has same set of digits as n and is greater than n. If x is the greatest possible number with its set of digits, then print “not possible”.
The first line of input contains an integer T denoting the number of test cases.
The first line of each test case is n,n is the number.
Print the greater number than n with same set of digits and if not possible then print "not possible" without double quote.
1 ≤ T ≤ 100
1 ≤ n ≤ 100000
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Login to access your submissions.
Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.