#include<bits/stdc++.h>
using namespace std;
int t,n;
struct node{
	int u,id,f;
}a[200005];
bool cmp1(node c,node b){
	return c.u>b.u;
}
bool cmp2(node c,node b){
	if(c.id==b.id){
		return c.u>b.u;
	}return c.id<b.id;
}
int main(){
	freopen("Lineup.in","r",stdin);
	freopen("Lineup.out","w",stdout);
	cin>>t;
	while(t--){
		cin>>n;
		for(int i=1;i<=n;i++){
			cin>>a[i].u;
			a[i].id=i;
		}
		sort(a+1,a+n+1,cmp1);
		int kk=1;
		for(int i=1;i<=n;i++){
			if(a[i+1].id<a[i].id){
				if(a[i+1].id>a[i-kk].id&&a[i].u!=a[i+1].u){
					a[i].id=a[i+1].id;
					kk=1;
				}
				if(a[i].u==a[i+1].u)kk++;
				break;
			}
		}
		sort(a+1,a+n+1,cmp2);
		a[n].f=a[n].u;
		for(int i=n-1;i>=1;i--){
			a[i].f=max(a[i].u,a[i+1].f);
		}
//		for(int i=1;i<=n;i++){
//			cout<<a[i].u<<" "<<a[i].f<<endl;
//		}
		for(int i=1;i<=n;i++){
			if(a[i].u==a[i].f){
				cout<<a[i].u<<" ";
			}
		}cout<<"\n";
	}
	return 0; 
}