#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cctype>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>

#define ll long long
#define INF 1000000000
using namespace std;
const int maxn=100009;
int a[maxn],d[maxn],dp[maxn];

int n;
int BinSearch(int key, int* d, int low, int high)
{
    while(low<=high)
    {
        int mid = (low+high)>>1;
        if(key>d[mid] && key<=d[mid+1])
            return mid;
        else if(key>d[mid])
            low = mid+1;
        else
            high = mid-1;
    }
    return 0;
}

int LIS(int* a, int n, int* d)
{
    int i,j;
    d[1] = a[1];
    int len = 1;    //递增子序列长度
    dp[1] = 1;
    for(i = 2; i <= n; i++)
    {
        if(d[len]<a[i])
            j = ++len;
        else
            j = BinSearch(a[i],d,1,len) + 1;
        d[j] = a[i];
        dp[i] = j;
    }
    return len;
}
int main()
{
    int T;scanf("%d",&T);
    while(T--){
        memset(dp,0,sizeof(dp));
        memset(d,0,sizeof(d));
        memset(a,0,sizeof(a));
        scanf("%d",&n);
        for( int i = 1; i <= n; i++ ){
            scanf("%d",&a[i]);
        }
        LIS(a,n,d);
        for( int i = 1; i <= n; i++ ){
            printf("%d%c",dp[i],i==n?'\n':' ');
        }
    }
    return 0;
}