#include<map>

 #include<cstdio>

 #include<cmath>

 #include<queue>

 #include<vector>

 #include<string>

 #include<cstring>

 #include<algorithm>

 #include<functional>

 #define pb push_back

 #define ls l,m,rt<<1

 #define rs m+1,r,rt<<1|1

 #define mst(a,b) memset(a,b,sizeof(a))

 #define F(i,a,b) for(int i=a;i<=b;++i)

 #define ___ freopen("c:\\acm\\input.txt","r",stdin);

 using namespace std;

 typedef long long LL;

 int n,a[],ans[];

 int main(){

     int t;

     scanf("%d",&t);

     while(t--)

     {

         int len=,tp;

         scanf("%d%d",&n,&tp);

         a[]=tp,ans[]=;

         F(i,,n)

         {

             scanf("%d",&tp);

             if(a[len]<tp)a[++len]=tp,ans[i]=len;

             else {

                 int pos=lower_bound(a+,a++len,tp)-a;

                 a[pos]=tp,ans[i]=pos;

             }

         }

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

     }

     return ;

 }