#include<bits/stdc++.h>
using namespace std;

#define sz(x) (int)x.size();
#define all(x) x.begin(), x.end();

const int N = 1e2 + 200;
const int inf = 1e9;

int n, p[N];
int go[N], pos[N], dead[N];
vector<int> x[N], y[N];

void solve() {
    cin >> n;
    for (int i = 0; i <= n; ++i) {
        x[i].clear();
        dead[i] = 0;
        y[i].clear();
    }
    vector<int> dp(n + 1, inf), pos(n + 1, 0);
    dp[0] = -inf;
    for (int i = 1; i <= n; ++i) {
        cin >> p[i];
        int j = upper_bound(dp.begin(), dp.end(), p[i]) - dp.begin();
        dp[j] = p[i];
        if (dp[j - 1] >= 1)
            go[i] = pos[dp[j - 1]];
        pos[p[i]] = i;
    }
    vector<int> lis;
    for (int i = n; i >= 1; --i) {
        if (dp[i] != inf) {
            i = pos[dp[i]];
            while (i >= 1) {
                lis.push_back(i);
                i = go[i];
            }
            reverse(lis.begin(), lis.end());
            break;
        }
    }
    vector<int> sil;
    for (int i : lis) {
        sil.push_back(p[i]);
        dead[i] = 1;
    }
    lis.push_back(n + 1);
    sil.push_back(n + 1);
    for (int i = 1; i <= n; ++i) {
        if (dead[i]) continue;
        int j = upper_bound(sil.begin(), sil.end(), p[i]) - sil.begin();
        int k = upper_bound(lis.begin(), lis.end(), i) - lis.begin();
        if (j > k)
            x[j].push_back(p[i]);   
        else
            y[k].push_back(i);
    }
    for (int i = 0; i < lis.size(); ++i) {
        sort(x[i].begin(), x[i].end());
        sort(y[i].begin(), y[i].end());
        for (auto j : x[i]) cout << pos[j] << " ";
        for (auto j : y[i]) cout << j << " ";
        if (lis[i] != n + 1)
            cout << lis[i] << " ";
    }
    cout << '\n';
}

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    int T = 1;
    cin >> T;
    while (T--) solve();
}