#include <bits/stdc++.h>
using namespace std;
const int N=1e6+7;
int n,t;
struct node{
	int num,id;
}a[N];
bool cmp(node a,node b){
	if(a.num==b.num) return a.id<b.id;
	return a.num>b.num;
}
vector<int>ans;
int main(){
	freopen("Lineup.in","r",stdin);
	freopen("Lineup.out","w",stdout);
	cin>>t;
	while(t--){
		memset(a,0,sizeof(a));
		ans.clear();
		cin>>n;
		for(int i=1;i<=n;i++){
			cin>>a[i].num;
			a[i].id=i;
		}
		sort(a+1,a+n+1,cmp);
		bool pd=0;
		int pre=0,prpre=0;
		for(int i=1;i<=n;i++){
			if(a[i].id>a[pre].id){
				prpre=pre;
				pre=i;
			}
			if(a[prpre].id<a[i].id&&a[i].id<a[pre].id){
				a[pre].id=a[prpre].id;
				break;
			}
		}
		int laid=0,lanum=0;
		for(int i=1;i<=n;i++){
			if(a[i].id>=laid){
				if(lanum!=0){
					cout<<lanum<<" ";
				}			
				lanum=a[i].num;
				laid=a[i].id;				
			}
		}
		cout<<lanum<<"\n";
	}
	
	return 0;
}