#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
#define inputt int t;cin>>t;
#define pi acos(-1.0)
#define lson o*2,l,m
#define rson o*2+1,m+1,r
#define INF 0x7f7f7f7f
#define lowbit(X) ((X)&(-X))
#define clr(X,Y) memset(X,Y,sizeof(X))
typedef long long ll;
using namespace std;
int find(int *a,int len,int n){
    int l=0,r=len,m=(l+r)>>1;
    while(l<=r){
        if(n>a[m]){
            l=m+1;
        }
        else if(n<a[m])r=m-1;
        else return m;
        m=(l+r)>>1;
    }
    return l;
}
int a[100010];
int c[100010];
int b[100010];
int len;
int main(){
    int n;
    int t;
    cin>>t;
    while(t--){
        scanf("%d",&n);
        for(int i=0;i<n;i++)scanf("%d",&a[i]);
        clr(c,0);
        c[0]=-1;
        c[1]=a[0];
        b[0]=1;
        len=1;
        for(int i=1;i<n;i++){
            int j=find(c,len,a[i]);
            c[j]=a[i];
            if(j>len)len=j;
            b[i]=j;
        }
        printf("%d",b[0]);
        for(int i=1;i<n;i++)printf(" %d",b[i]);
        printf("\n");
    }
    return 0;
}