#include <bits/stdc++.h>

using namespace std;

const int N = 1e5+;

int rise[N],ans[N];

int n;

int main(){

    int T;scanf("%d",&T);

    while(T--){

        scanf("%d",&n);

        int len=;rise[]=-;

        for(int i=;i<=n;i++){

            int data;scanf("%d",&data);

            if(data>rise[len])rise[++len]=data,ans[i]=len;     //记录以i为末尾的最长上升子序列的长度

            else {

                int loc=lower_bound(rise+,rise++len,data)-rise;     //最长上升子序列用lower_bound

                rise[loc]=data;

                ans[i]=loc;     //记录以i为末尾的最长上升子序列的长度

            }

        }

        for(int i=;i<=n;i++)

            i==n?printf("%d\n",ans[i]):printf("%d ",ans[i]);

    }

}