#include<bits/stdc++.h>
#define int long long
using namespace std;
bool cmp(const pair<int, int> &x, const pair<int, int> &y)
{
	if (x.first == y.first) {
		return x.second < y.second;
	}
	return x.first > y.first;
}
void solve()
{
	int n;
	cin >> n;
	vector<pair<int, int>> a(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i].first;
		a[i].second = i;
	}
	int tp1 = -1, tp2 = -1, flag = 0;
	sort(a.begin(), a.end(), cmp);
	for (int i = 0; i < n; i++){
		if (a[i].second > tp1) {
			tp2 = tp1;				
			tp1 = a[i].second;
			cout << a[i].first << ' ';
		} else if (flag == 0 && a[i].second > tp2) {
			flag = 1;
			tp1 = a[i].second;
			cout << a[i].first << ' ';
		}
	}
	cout << '\n';
}
signed main()
{
    freopen("Lineup.in", "r", stdin);
    freopen("Lineup.out", "w", stdout);
	int T;
	cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}