#include <bits/stdc++.h>
#define lli long long int
using namespace std;

void solveCase()
{
    int n; cin >> n;
    vector<int> v(n);
    for (int i = 0; i < n; i++)
    {
        cin >> v[i]; v[i]--;
    }
    vector<bool> visited(n, false);
    vector<int> solution;
    for (int i = 0; i < n; i++)
    {
        if (!visited[i])
        {
            solution.push_back(i);
            int j = v[i];
            while (j != i)
            {
                solution.push_back(j);
                j = v[j];
            }
        }
    }
    cout << solution[0] + 1;
    for (int i = 1; i < n; i++)
    {
        cout << " " << solution[i] + 1;
    }
    cout << "\n";
}

int main()
{
    int n; cin >> n; while (n--)
    {
        solveCase();
    }
    return 0;
}