#include <bits/stdc++.h>

void solve() {

    int n;
    std::cin >> n;
    std::vector<int> a(n + 1), mp(n + 1), vis(n + 1);
    for (int i = 1; i <= n; i ++) {
        std::cin >> a[i];
        mp[a[i]] = i;
    }

    std::vector<int> ans;

    for (int i = 1; i <= n; i ++) {
        if (vis[i]) continue;
        if (!vis[mp[i]]) {
            vis[i] = 1, vis[mp[i]] = 1;
            ans.emplace_back(i);
            if (mp[i] != i) ans.emplace_back(mp[i]);
        }
    }

    for (int i = 1; i <= n; i ++) {
        if (!vis[i]) {
            ans.emplace_back(i);
        }
    }

    for (int i = 0; i < n; i ++) {
        std::cout << ans[i] << " \n"[i == n - 1];
    }
}

int main() {

    int t;
    std::cin >> t;
    while (t --) solve();
}