#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
struct emt{int x,y;}e[100005];
bool cmp(emt a,emt b) {return(a.x<b.x);}
int a[100005],b[100005],f[100005];
int lowbit(int x) {return(x&-x);}
int query(int x) {int ans=0;while (x) {ans=max(ans,b[x]);x-=lowbit(x);}return(ans);}
void modify(int x,int val,int n) {while (x<=n) {b[x]=max(b[x],val);x+=lowbit(x);}}
int main()
{
  //  freopen("in.txt","r",stdin);freopen("out.txt","w",stdout);
    int T,i,j,n;
    scanf("%d",&T);
    while (T--)
    {
        scanf("%d",&n);e[0].x=-1000;
        for (i=1;i<=n;i++) {scanf("%d",&e[i].x);e[i].y=i;}
        sort(e+1,e+n+1,cmp);
        for (i=1,j=0;i<=n;i++) {if (e[i].x>e[i-1].x) j++;a[e[i].y]=j;}
        for (i=1;i<=n;i++) b[i]=0;
        for (i=1;i<=n;i++)
        {
            f[i]=query(a[i]-1)+1;
            modify(a[i],f[i],n);
            printf("%d",f[i]);if (i<n) printf(" ");    
        }
        printf("\n");
    }
    
    return 0;
}