#include <iostream>
#include <stdio.h>
using namespace std;
int findd(int *a,int len,int n)
{
    int left=0,right=len,mid=(left+right)/2;
    while(left<=right)
    {
       if(n>a[mid]) left=mid+1;
       else if(n<a[mid]) right=mid-1;
       else return mid;
       mid=(left+right)/2;
    }
    return left;
}
int a[100005],c[100005],b[100005];
int main()
{

    int t,n,i,j,len;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(i=0;i<n;i++)
            scanf("%d",a+i);
        b[0]=1;
        c[0]=-1;
        c[1]=a[0];
        len=1;
        for(i=1;i<n;i++)
        {
            j=findd(c,len,a[i]);
            c[j]=a[i];
            b[i]=j;
            if(j>len)
                len=j;
        }
        printf("1");
        for(int i=1;i<n;i++) printf(" %d",b[i]);
        printf("\n");
    }
    return 0;
}