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 challenged 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

Added by:! include(L.ppt)
Date:2012-08-31
Time limit:1.297s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:MNNIT OPC 31-08-2012

hide comments
2017-10-25 16:40:32
no need of any stl or any special fns!!
2017-10-05 19:16:58
http://www.nayuki.io/page/next-lexicographical-permutation-algorithm

How next_permutation works one must know? This helped a lot the diagram explanation.
2017-10-04 17:43:01
hello
2017-08-26 21:58:49
Did without STL :)
2017-07-26 14:27:16
Dont forget the case of -1. Costed me 1WA
2017-03-02 06:37:20
int I/O 0.13; char I/O 0.02
2016-12-31 06:13:21 loverboy
did without STL and with STL next_permutation().
2016-12-19 08:28:42
answer will be -1 for cases like : 5 4 3 2 1
its next largest number is not possible if same digits are to be used :)
2016-11-10 11:50:02
throw some light on cases where ans would be -1?spojtoolkit cant help me.. :(
2016-08-21 12:37:13
AC IN 2 WUHUU
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.