Find the Smallest number (Not leading Zeros) which can be obtained by rearranging the digits of given number.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains the number N.
Print the smallest number which can be made by rearranging the digits of the given number.
1 <= T <= 100
1 <= N <= 101000
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.