#include<iostream>
#include<cstdio>
#define rep(i,x,y) for(register int i=(x);i<=(y);++i)
const int maxn=1e5+10;
using namespace std;

int n,a[maxn],f[maxn],b[maxn],g[maxn];
int find(int x){
    int l=0,r=n;
    while(l<r){
        int m=(l+r+1)>>1;
        if(g[m]<x)l=m;else r=m-1;
    }
    return l;
}

int main(){
    int T;scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        rep(i,1,n)scanf("%d",&a[i]);
        g[0]=0;rep(i,1,n)g[i]=1e9;
        rep(i,1,n){
            f[i]=find(a[i])+1;
            g[f[i]]=a[i];
        }
        printf("1");rep(i,2,n)printf(" %d",f[i]);puts("");
    }
    return 0;
}