#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>

using namespace std;

const int N=110000;

int n,val[N];
vector<int> vt;
int num[N];
int binarySearch(int x){
    int left=0,right=vt.size()-1;
    int mid;
    while(left<=right){
        mid=(left+right)>>1;
        if(vt[mid]<x)
            left=mid+1;
        else
            right=mid-1;
    }
    return left;
}

int main(){

    int T;
    scanf("%d",&T);
     while(T--)
    {
        scanf("%d",&n);
        vt.clear();
        for(int i=0;i<n;i++)
            scanf("%d",&val[i]);
        int tmp;
        for(int i=0;i<n;i++)
        {
            tmp=binarySearch(val[i]);
            if(tmp>=(int)vt.size())
                vt.push_back(val[i]);
            else
                vt[tmp]=val[i];
            num[i]=tmp;
        }
        for(int i=0;i<n-1;i++)
            printf("%d ",num[i]+1);
        printf("%d\n",num[n-1]+1);
    }
    return 0;
}