#include<cstdio>
#include<algorithm>
#define N 200005
using namespace std;
int t,n,x,y;bool f;
struct node{int v,i;bool operator<(node y){return v^y.v?v>y.v:i<y.i;}}a[N];
int read(){
	int sum=0;bool f=0;char c=getchar();
	for(;c<48||c>57;c=getchar())if(c==45)f=1;
	for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
	return f?-sum:sum;
}
int main(){
	freopen("Lineup.in","r",stdin);freopen("Lineup.out","w",stdout);
	t=read();
	while(t--)
	{
		n=read();for(int i=1;i<=n;i++)a[i]={read(),i};
		sort(a+1,a+n+1);
		f=1;x=y=0;
		for(int i=1;i<=n;i++)
			if(a[i].i>x)printf("%d ",a[i].v),y=x,x=a[i].i;
			else if(f&&a[i].i>y)
				printf("%d ",a[i].v),f=0,x=a[i].i,y=x-1;
		printf("\n");
	}
	return 0;
}