#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <iostream>
#include <stack>
#include <vector>
#include <bitset>
#define x first
#define y second
using namespace std;
typedef int LL;
int a[100005],dp[100005],c[100005];
int findf(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;
}

void init(int *a,int n)
{
    for(int i=0;i<=n;i++)
        a[i]=2100000000;
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int i,j,n;
        scanf("%d",&n);
        {
            init(c,n+1);
            for(i=0; i<n; i++)
                scanf("%d",&a[i]);
            c[0]=-1;
            c[1]=a[0];
            dp[0]=1;
            for(i=1; i<n; i++)
            {
                j=findf(c,n+1,a[i]);
                c[j]=a[i];
                dp[i]=j;
            }
            for(i=0; i<n; i++)
            {
                printf("%d",dp[i]);
                if(i==n-1)
                    printf("\n");
                else
                    printf(" ");
            }
        }
    }
    return 0;

}