#include<bits/stdc++.h>

using i64 = long long;
using l64 = long double;

void DAOQI() {
    int n;
    std::cin >> n;
    std::vector<int> p(n + 1), q(1);
    std::set<int> se;
    for (int i = 1; i <= n; i++) {
        std::cin >> p[i];
        if (p[i] == i) {
            se.insert(i);
            q.push_back(i);
        } else {
            if (!se.count(i)) {
                q.push_back(i);
                se.insert(i);
            }
            if (!se.count(p[i])) {
                q.push_back(p[i]);
                se.insert(p[i]);
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        std::cout << q[i] << " \n"[i == n];
    }
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int T = 1;
    std::cin >> T;
    while (T--) DAOQI();
    return 0;
}