JNEXT  Just Next !!!
DevG likes too much fun to do with numbers. Once his friend Arya came and gave him a challenge, he gave DevG an array of digits which is forming a number currently (will be called as given number). DevG was challanged to find the just next greater number which can be formed using digits of given number. Now DevG needs your help to find that just next greater number and win the challenge.
Input
The first line have t number of test cases (1 <= t <= 100). In next 2*t lines for each test case first there is number n (1 <= n <= 1000000) which denotes the number of digits in given number and next line contains n digits of given number separated by space.
Output
Print the just next greater number if possible else print 1 in one line for each test case.
Note : There will be no test case which contains zero in starting digits of any given number.
Example
Input: 2 5 1 5 4 8 3 10 1 4 7 4 5 8 4 1 2 6 Output: 15834 1474584162
hide comments
starboy_jb:
20180123 14:05:24
next_permutation().....


nadstratosfer:
20180114 05:42:24
mayank_soni055: http://www.spoj.com/ranks/JNEXT/lang=PYTH%203.2.3


mayank_soni055:
20180113 11:49:57
Don't try in PYTHON it'll give you TLE use C/C++ 

Avinash Raj:
20180110 06:40:07
Don't use Java you'll get TLE. 

lucifer1704:
20180108 12:11:21
what is the max possible number? there's info max total number possible... but nothing of max number possible.


silkypriya:
20180103 20:58:35
AC in go :) Thanks to STL vector.


pyrojathon:
20171229 17:56:52
whats wrong with this code ?


owl_a:
20171223 19:53:00
Same code shows Passed on Geeksforgeeks but wrong answer here. Is there a case I'm missing ?


ritwikshanker:
20171214 16:55:02
Getting TLE in JAVA. SHITTY SPOJ!!! Same soln in c++ submitted. They need to check their time limit for each language. 

epsilonalpha:
20171125 02:27:09
AC in 1 go. :) 
Added by:  ! include(L.ppt) 
Date:  20120831 
Time limit:  1.297s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  MNNIT OPC 31082012 