#include <iostream>    
#include <stdio.h>    
#include <cmath>    
#include <algorithm>    
#include <string>  
#include <string.h>       
#include <vector>    
#include <queue>    
#include <stack>
#include <map>

using namespace std;

#define ll long long


const int maxn = 100010; 

int a[maxn];       //a[i] &#212;-ê&#188;êy&#190;Y  
int d[maxn];       //d[i] 3¤&#182;è&#206;aiμ&#196;μY&#212;&#246;×óDòáDμ&#196;×&#238;D&#161;&#214;μ  
int ans[maxn];

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;        //μY&#212;&#246;×óDòáD3¤&#182;è  
    ans[1] = 1;
    for(i = 2; i <= n; i++)  
    {  
        if(d[len]<a[i]){
            j = ++len;
            ans[i] = len;
        }else{
            j = BinSearch(a[i],d,1,len) + 1;
            ans[i] = j;
        }  
        d[j] = a[i];  
    }  
    return len;  
}  
  
int main()  
{  
    int t;  
    int n;  
    scanf("%d",&t);  
    while(t--){
        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",ans[i]);
            if(i!=n){
                printf(" ");
            } 
        }
        printf("\n");
    }  
    return 0;  
}