#include <cstdio>
#include <algorithm>
#include <cstring>
#define rep(i, l, r) for(int i=l; i<=r; i++)
#define dow(i, l, r) for(int i=l; i>=r; i--)
#define clr(x, c) memset(x, c, sizeof(x))
#define travel(x) for(edge *p=fir[x]; p; p=p->n)
#define all(x) (x).begin,(x).end
#define pb push_back
#define fi first
#define se second
#define l(x) Left[x]
#define r(x) Right[x]
#define lowbit(x) (x&-x)

using namespace std;

typedef long long ll;
typedef pair<int,int> Pii;
typedef long double ld;
typedef unsigned long long ull;

inline int read()
{
    int x=0; bool f=0; char ch=getchar();
    while (ch<'0' || '9'<ch) f|=ch=='-', ch=getchar();
    while ('0'<=ch && ch<='9') x=x*10+ch-'0', ch=getchar();
    return f?-x:x;
}

#define maxn 100009
#define inf 0x7fffffff

int n, k[maxn], now, f[maxn];

inline int Find(int r, int x)
{
    int l=0; while (l<r)
    {
        int mid=(l+r)>>1;
        if (k[mid+1]<x) l=mid+1; else r=mid;
    } return l;
}

int main()
{
    int t=read(); while (t--)
    {
        n=read(); rep(i, 1, n) k[i]=inf; now=0;
        rep(i, 1, n)
        {
            int a=read(), x=Find(now,a);
            k[x+1]=a, f[i]=x+1, now=max(now,x+1);
        }
        rep(i, 1, n) printf("%d%c", f[i], i==n?'\n':' ');
    }
    return 0;
}