#include<iostream>
#include<vector>
#include<map>
#include<queue>
#include<string>
#include<cstring>
#include<algorithm>
#define int long long
using namespace std;
const int N = 2e5 + 7;
int arr[1000005];
void solve() {
    int n; cin >> n;
    map<int, int>mp;
    for (int i = 1; i <= n; i++)
    {
        cin >> arr[i];
        mp[arr[i]] = i;
    }
    int l = 1,flag=0,r=1;
    for (int i = 1; i <= n; i++)
    {
        if (flag)
        {
            if (mp[arr[l - 1]] == arr[l - 1])
                i--;
            else cout << arr[l - 1] << " ";
            flag = 0;
        }
        else
        {
            cout << l << " ";
            flag = 1;
            l++;
        }
    }
    cout << endl;
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int t; cin >> t;while(t--) solve();
    return 0;
}