#include<bits/stdc++.h>
#define int long long
using namespace std;
int T1, n, a[200005];
pair<int, int> val[200005];
int cmp(pair<int, int> &x, pair<int, int> &y){
	if(x.first != y.first)return x.first > y.first;
	else return x.second < y.second;
	//if they have different value, return bigger one, otherwise
	//return the one that appeared earlier
}
signed main(){
	cin>>T1;
	while(T1--){
		cin>>n;
		for(int i = 1; i <= n; i++){
			cin>>a[i];
			val[i].first = a[i];
			val[i].second = i;
		}
		int ma = 0, ma2 = 0, moved = 0, outp = 0;
		sort(val + 1, val + n + 1, cmp);
		for(int i = 1; i <= n; i++){
			if(val[i].second > ma){
				ma2 = ma;				
				ma = val[i].second;
				if(outp)cout<<" "<<val[i].first;
				else cout<<val[i].first;
				outp = 1;
			}else if(val[i].second > ma2 && !moved){
				ma = val[i].second;
				//we move ma
				if(outp)cout<<" "<<val[i].first;
				else cout<<val[i].first;
				outp = 1;
				moved = 1;
//				cout<<val[i].second<<endl;
			}
		}
		cout<<endl;
	}
	return 0;
}