A15119 | Permutation Weight (Hard Version)

This is a hard version of the problem. The difference between the easy and hard versions is that in this version, you have to output the lexicographically smallest permutation with the smallest weight.

You are given a permutation $p_1, p_2, \ldots, p_n$ of integers from $1$ to $n$ .

Let's define the weight of the permutation $q_1, q_2, \ldots, q_n$ of integers from $1$ to $n$ as $$$$|q_1 - p_{q_{2}}| + |q_2 - p_{q_{3}}| + \ldots + |q_{n-1} - p_{q_{n}}| + |q_n - p_{q_{1}}| $$ </p><p>You want your permutation to be as lightweight as possible. Among the permutations $q$ with the smallest possible weight, find the lexicographically smallest.</p><p>Permutation $a\_1, a\_2, \\ldots, a\_n$ is lexicographically smaller than permutation $b\_1, b\_2, \\ldots, b\_n$ , if there exists some $1 \\le i \\le n$ such that $a\_j = b\_j$ for all $1 \\le j &lt; i$ and $a\_i&lt;b\_i$$$.

The first line of the input contains a single integer $t$ ( $1 \le t \le 100$ ) — the number of test cases. The description of the test cases follows.

The first line of each test case contains a single integer $n$ ( $2 \le n \le 200$ ) — the size of the permutation.

The second line of each test case contains $n$ integers $p_1, p_2, \ldots, p_n$ ( $1 \le p_i \le n$ , all $p_i$ are distinct) — the elements of the permutation.

The sum of $n$ over all test cases doesn't exceed $400$ .

For each test case, output $n$ integers $q_1, q_2, \ldots, q_n$ ( $1 \le q_i \le n$ , all $q_i$ are distinct) — the lexicographically smallest permutation with the smallest weight.