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

const int N = 2e5 + 5;

int T, n, tot, p[N], low[N], pos[N], pre[N], rk[N];

void work() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> p[i];
		rk[p[i]] = i;
	}
	tot = 0;
	for (int i = 1; i <= n; i++) {
		if (!tot || low[tot] < p[i]) {
			low[++tot] = p[i], pos[tot] = i, pre[i] = pos[tot - 1];
		}
		else {
			int x = lower_bound(low + 1, low + tot + 1, p[i]) - low;
			low[x] = p[i], pos[x] = i, pre[i] = pos[x - 1];
		}
	}
	for (int i = tot - 1; i >= 1; i--) {
		pos[i] = pre[pos[i + 1]];
	}
	pos[++tot] = n + 1, p[n + 1] = n + 1;
	for (int i = 1; i < tot; i++) {
		int l = pos[i], r = pos[i + 1];
		cout << l << ' ';
		for (int j = l + 1; j < r; j++) {
			if (p[j] < p[r]) {
				cout << j << ' ';
			}
		}
		for (int j = p[l] + 1; j < p[r]; j++) {
			if (rk[j] < r) {
				cout << rk[j] << ' ';
			}
		}
	}
	cout << '\n';
}

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	cin >> T;
	while (T--) {
		work();
	}

	return 0;
}