#include <bits/stdc++.h>
#define all(a) begin(a), end(a)
#define sz(a) (int) (a).size();
#define int long long
using namespace std;

const int N_MAX = 1e6 + 11;
int p[N_MAX], q[N_MAX];
bool vis[N_MAX];
void solve() {
    int n; cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> p[i];
    }

    int c = 0;
    for (int i = 1; i <= n; i++) {
        if (!vis[i]) {
            vis[i] = true;
            q[++c] = i;
            int x = p[i];
            while (x != i) {
                vis[x] = true;
                q[++c] = x;
                x = p[x];
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        cout << q[i] << " \n"[i == n];
    }
}

int32_t main(){
    cin.tie(0); cout.tie(0)->sync_with_stdio(false);
    int t; cin >> t;
    while (t--) {
        solve();
    }
}