B"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}}| You want your permutation to be as lightweight as possible. Among the permutations q with the smallest possible weight, find the lexicographically smallest. 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 <= i <= n such that a_j = b_j for all 1 <= j < i and a_i<b_i . The first line of the input contains a single integer t ( 1 <= t <= 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 <= n <= 200 ) -- the size of the permutation. The second line of each test case contains n integers p_1, p_2, ldots, p_n ( 1 <= p_i <= 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 <= q_i <= n , all q_i are distinct) -- the lexicographically smallest permutation with the smallest weight. In the first test case, there are two permutations of length 2 : (1, 2) and (2, 1) . Permutation (1, 2) has weight |1 - p_2| + |2 - p_1| = 0 , and the permutation (2, 1) has the same weight: |2 - p_1| + |1 - p_2| = 0 . In this version, you have to output the lexicographically smaller of them -- (1, 2) . In the seco"...