CF1685D1.Permutation Weight (Easy Version)

This is an easy version of the problem. The difference between the easy and hard versions is that in this version, you can output any 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. Find any permutation $q$ with the smallest possible weight.

这是一个该问题的简单版本。简单版本与困难版本的区别在于：在本版本中，你只需输出任意一个具有最小权值的排列即可。

给定一个 $1$ 到 $n$ 的整数排列 $p_1, p_2, \ldots, p_n$。

我们定义 $1$ 到 $n$ 的一个排列 $q_1, q_2, \ldots, q_n$ 的权值为

$$|q\_1 - p\_{q\_{2}}| + |q\_2 - p\_{q\_{3}}| + \ldots + |q\_{n-1} - p\_{q\_{n}}| + |q\_n - p\_{q\_{1}}|$$

你希望所构造的排列尽可能轻（即权值尽可能小）。请找出任意一个权值最小的排列 $q$。

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$.

输入的第一行包含一个整数 $t$（$1 \le t \le 100$），表示测试用例的数量。随后是各测试用例的描述。

每个测试用例的第一行包含一个整数 $n$（$2 \le n \le 200$），表示排列的长度。

每个测试用例的第二行包含 $n$ 个整数 $p_1, p_2, \ldots, p_n$（$1 \le p_i \le n$，且所有 $p_i$ 互不相同），表示该排列的各个元素。

所有测试用例的 $n$ 值之和不超过 $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) — one of the permutations with the smallest weight.

对于每个测试用例，输出 $n$ 个整数 $q_1, q_2, \ldots, q_n$（其中 $1 \le q_i \le n$，且所有 $q_i$ 互不相同）——即一个具有最小权值的排列。

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 permutation $(2, 1)$ has the same weight: $|2 - p_1| + |1 - p_2| = 0$. You can output any of these permutations in this version.

In the second test case, the weight of the permutation $(1, 3, 4, 2)$ is $|1 - p_3| + |3 - p_4| + |4 - p_2| + |2 - p_1| = |1 - 1| + |3 - 4| + |4 - 3| + |2 - 2| = 2$. There are no permutations with smaller weights.

In the third test case, the weight of the permutation $(1, 4, 2, 3, 5)$ is $|1 - p_4| + |4 - p_2| + |2 - p_3| + |3 - p_5| + |5 - p_1| = |1 - 2| + |4 - 4| + |2 - 3| + |3 - 1| + |5 - 5| = 4$. There are no permutations with smaller weights.

在第一个测试用例中，长度为 $2$ 的排列有两个：$(1, 2)$ 和 $(2, 1)$。排列 $(1, 2)$ 的权重为 $|1 - p_2| + |2 - p_1| = 0$，排列 $(2, 1)$ 的权重同样为 $|2 - p_1| + |1 - p_2| = 0$。在此版本中，你可以输出其中任意一个排列。

在第二个测试用例中，排列 $(1, 3, 4, 2)$ 的权重为 $|1 - p_3| + |3 - p_4| + |4 - p_2| + |2 - p_1| = |1 - 1| + |3 - 4| + |4 - 3| + |2 - 2| = 2$。不存在权重更小的排列。

在第三个测试用例中，排列 $(1, 4, 2, 3, 5)$ 的权重为 $|1 - p_4| + |4 - p_2| + |2 - p_3| + |3 - p_5| + |5 - p_1| = |1 - 2| + |4 - 4| + |2 - 3| + |3 - 1| + |5 - 5| = 4$。不存在权重更小的排列。