Next Permutation Problem Statement

Given a permutation of ‘N’ integers, rearrange them to generate the lexicographically next greater permutation. A sequence is a permutation if it contains all integers from 1 to ‘N’ exactly once. If the next greater permutation is not possible, return the lexicographically smallest permutation.

Input:

The first line contains a single integer ‘T’ denoting the number of test cases.
The first line of each test case contains an integer ‘N’ denoting the length of the permutation.
The second line contains ‘N’ space-separated integers representing the permutation.

Output:

For each test case, print the lexicographically next greater permutation as a single line of space-separated integers. If no greater permutation exists, print the smallest permutation.

Example:

Input: 
1
3
1 3 2
Output:
2 1 3

Constraints:

• 1 <= T <= 50
• 1 <= N <= 10000
• 1 <= P[i] <= N
• Time limit: 1 sec

Note:

You do not need to print anything; it is handled for you.