lexicographically-preceding-permutation
Source: hackerearth
Difficulty: UNKNOWN_DIFFICULTY

Given an integer n and a permutation of numbers 1, 2 ... , n-1, n write a program to print the permutation that lexicographically precedes the given input permutation. If the given permutation is the lexicographically least permutation, then print the input permutation itself. 

Input Format: 

First line is the test cases and second line contains value of integer n: 1 ≤ n ≤ 1,000,000 
third line is a space separated list of integers 1 2 ... n permuted in some random order 

Output Format: 

Output a single line containing a space separated list of integers which is the lexicographically preceding permutation of the input permutation.

SAMPLE INPUT
1
3
1 3 2

SAMPLE OUTPUT
1 2 3


for _ in range(eval(input())):
	n= eval(input())
	a=list(map(int,input().split()))
	b=[]
	flag=0
	for x in range(n-1,0,-1):
		b=a[:x-1]
		if a[x]<a[x-1]:
			for y in range(n-1,x-1,-1):
				if a[x-1]>a[y]:
					b.append(a[y])
					flag=1
					c=a[x-1:]
					del(c[y-x+1])
					c.sort()
					c.reverse()
					b=b+c
				if flag==1:
					break
		if flag==1:
			break
	if flag==0:
		print(' '.join(str(x) for x in a))
	else :
		print(' '.join(str(x) for x in b))