#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>#define MAX 100007#define INF (1<<29)usingnamespacestd;
int t,n;
int a[MAX];
int pos[MAX];
int vis[MAX];
int ans[MAX];
struct Tree
{
int l,r;
int maxn;
}tree[MAX<<2];
void push_up ( int u )
{
tree[u].maxn = max ( tree[u<<1].maxn , tree[u<<1|1].maxn );
}
void build ( int u , int l , int r )
{
tree[u].l = l;
tree[u].r = r;
if ( l == r )
{
tree[u].maxn = a[l];
return;
}
int mid = l + r >>1;
build ( u<<1 , l , mid );
build ( u<<1|1 , mid+1 , r );
push_up ( u );
}
void update ( int u , int x )
{
int l = tree[u].l;
int r = tree[u].r;
int mid = l + r >>1;
if ( l == r )
{
tree[u].maxn = -a[l];
return;
}
if ( x > mid ) update ( u<<1|1 , x );
else update ( u<<1 , x );
push_up ( u );
}
int query ( int u , int left , int right )
{
int l = tree[u].l;
int r = tree[u].r;
int mid = l + r >>1;
if ( left <= l && r <= right )
return tree[u].maxn;
int ret = -INF;
if ( left <= mid && right >= l )
ret = max ( ret , query ( u<<1 , left , right ));
if ( left <= r && right > mid )
ret = max ( ret , query ( u<<1|1 , left , right ));
return ret;
}
int lowbit ( int x )
{
return x&-x;
}
void add ( int x )
{
while ( x <= n )
{
vis[x] += 1;
x += lowbit(x);
}
}
int sum ( int x )
{
int ret = 0;
while ( x )
{
ret += vis[x];
x -= lowbit ( x );
}
return ret;
}
void init ( )
{
build ( 1 , 1 , n );
memset ( vis , 0 , sizeof ( vis ));
}
int bsearch ( int x )
{
int l = 0 , r = x , mid;
while ( l != r )
{
mid = l+r>>1;
if ( sum(x) - sum(mid) > 0 ) l = mid+1;
else r = mid;
}
return l+1;
}
int main ( )
{
scanf ( "%d" , &t );
while ( t-- )
{
scanf ( "%d" , &n );
for ( int i = 1 ; i <= n ; i++ )
{
scanf ( "%d" , &a[i] );
pos[a[i]] = i;
}
init ( );
for ( int i = 1 ; i <= n ; i++ )
{
int x = pos[i];
if ( sum(x)-sum(x-1) > 0 )
{
ans[i] = a[x+1];
continue;
}
int temp = -1;
if ( x != n && sum(x+1)-sum(x) == 0 ) temp = a[x+1];
int l = bsearch ( x );
int v = query ( 1 , l , x );
int y = pos[v];
if ( v > temp )
{
ans[i] = v;
for ( int j = y; j <= x ; j++ )
add ( j );
}
else
{
ans[i] = temp;
update ( 1 , x+1 );
}
}
for ( int i = 1 ; i < n ; i++ )
printf ( "%d " , ans[i] );
printf ( "%d\n" , ans[n] );
}
}