#include<bits/stdc++.h>
using namespace std;
int t,n;
struct cow{
	int num,i;
}a[200001]; 
bool cmp(cow x,cow y){
	if(x.num==y.num) return x.i<y.i;
	else return x.num>y.num; 
}
void f(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].num;
		a[i].i=i;
	}
	sort(a+1,a+n+1,cmp);
	int fz=0,bk=0,ans=-1,id=0;
	for(int i=1;i<=n;i++){
		if(a[i].i>a[bk].i){
			fz=bk;
			bk=i;
		}
		if(a[fz].i<a[i].i&&a[i].i<a[bk].i){
			a[bk].i=a[fz].i;
			break;
		}
	}
	for(int i=1;i<=n;i++){
		if(a[i].i>=id){
			if(ans!=-1) cout<<ans<<' ';
			id=a[i].i;
			ans=a[i].num;
		}
	}
    cout<<ans<<endl;
}
int main(){
    freopen("Lineup.in","r",stdin);
    freopen("Lineup.out","w",stdout);
	cin>>t;
	while(t--) f();
	return 0;
}