#include <cstdio>
#include <algorithm>
#include <iostream>
#include <cstring>
using namespace std;
typedef long long ll;
const ll inf = 0x7fffffff;
#define N 100005
int tree[400010];
struct num
{
    int id;
    int val, cval;
} a[100010];
bool cmp1(const num& a, const num& b)
{
    return a.val < b.val;
}
bool cmp2(const num& a, const num& b)
{
    return a.id < b.id;
}
int f[100010];
int query(int p, int l, int r, int x)
{
//    //cout << "**" << endl;
    //cout << " l = " << l << " r = " << r <<endl;
    if (x < 1)
    {
        //cout << "return x < 1" << endl;
        return 0;
    }
    if (1 <= l && r <= x)
    {
        //cout << "return 1 <= l && r <=x" << endl;
        //cout << "re = " << tree[p] << endl;
        return tree[p];
    }
    int mid = (l + r) >> 1;
    int re = 0;
    if (1 <= mid)
        re = max(re, query(p << 1, l, mid, x));
    //cout << "re = " << re << endl;
    if (mid < x)
        re = max(re, query(p << 1 | 1, mid + 1, r, x));
    //cout << "re = " << re << endl;
    return re;
}
int ins(int p, int l, int r, int x, int y)
{
    if (l == r)
        return (tree[p] = y + 1);
    int mid  = (l + r) >> 1;
    if (x <= mid)
        ins(p << 1, l, mid, x, y);
    else
        ins(p << 1 | 1, mid + 1, r, x, y);
    return (tree[p] = max(tree[p << 1], tree[p << 1 | 1]));

}
int main()
{
//    freopen("in.txt", "r", stdin);
    int t;
    scanf("%d", &t);
    while (t--)
    {
        int n;
        scanf("%d", &n);
        memset(tree, 0, sizeof tree);
        for (int i = 0; i < n; i++)
        {
            scanf("%d", &a[i].val);
            a[i].id = i;
        }
        sort(a, a + n, cmp1);
        int cnt = 1;
        a[0].cval = 1;
        for (int i = 1; i < n; i++)
        {
            if (a[i].val != a[i - 1].val)
                ++cnt;
            a[i].cval = cnt;
        }

        sort(a, a + n, cmp2);
//        for (int  i = 0; i < n; i++)
            //cout <<  " " << a[i].cval;
        //cout << endl;
        //cout << "cnt = "<< cnt << endl;
        for (int i = 0; i < n; i++)
        {
            //cout << "i = " << i << endl;
            f[i] = query(1, 1, cnt, a[i].cval - 1);
            ins(1, 1, cnt, a[i].cval, f[i]);
            f[i]++;
        }
        for (int i = 1; i <= n; i++)
            printf("%d%c", f[i - 1], i == n ? '\n' : ' ');
    }
    return 0;
}