Reverse solution codeforces – You are given a permutation $p_{1}, p_{2}, \dots, p_{n}$ of length $n$ . You have to choose two integers $l, r$ ( $1 \leq l \leq r \leq n$ ) and reverse the subsegment $[l, r]$ of the permutation. The permutation will become $p_{1}, p_{2}, \dots, p_{l - 1}, p_{r}, p_{r - 1}, \dots, p_{l}, p_{r + 1}, p_{r + 2}, \dots, p_{n}$ .

Find the lexicographically smallest permutation that can be obtained by performing exactly one reverse operation on the initial permutation.

Note that for two distinct permutations of equal length $a$ and $b$ , $a$ is lexicographically smaller than $b$ if at the first position they differ, $a$ has the smaller element.

A permutation is an array consisting of $n$ distinct integers from $1$ to $n$ in arbitrary order. For example, $[2, 3, 1, 5, 4]$ is a permutation, but $[1, 2, 2]$ is not a permutation ( $2$ appears twice in the array) and $[1, 3, 4]$ is also not a permutation ( $n = 3$ but there is $4$ in the array).

Reverse solution codeforces

Each test contains multiple test cases. The first line contains a single integer $t$ ( $1 \leq t \leq 500$ ) — the number of test cases. Description of the test cases follows.

The first line of each test case contains a single integer $n$ ( $1 \leq n \leq 500$ ) — the length of the permutation.

The second line of each test case contains $n$ integers $p_{1}, p_{2}, \dots, p_{n}$ ( $1 \leq p_{i} \leq n$ ) — the elements of the permutation.

Output

For each test case print the lexicographically smallest permutation you can obtain.