#include <bits/stdc++.h>
#include <bits/extc++.h>
#include <tr2/dynamic_bitset>

#define int int64_t

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

template<typename T>
using orset = tree<T, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update>;

template<typename T>
using ormultiset = tree<T, null_type, less_equal<>, rb_tree_tag, tree_order_statistics_node_update>;

const int N = 100;
int n;
int t[4 * N];
int a[N];
int d[N];

void build (int v, int tl, int tr) {
    if (tl == tr)
        t[v] = tl;
    else {
        int tm = (tl + tr)>>1;
        build(v<<1, tl, tm);
        build(v<<1|1, tm+1, tr);
        if(a[t[v<<1]] >= a[t[v<<1|1]])
            t[v] = t[v<<1];
        else
            t[v] = t[v<<1|1];
    }
}

int get(int v, int tl, int tr, int l, int r) {
    if (l > r)
        return -1;
    if (l == tl && r == tr)
        return t[v];
    int tm = (tl + tr) / 2;
    int l_ans = get(v<<1, tl, tm, l, min(r, tm)), r_ans = get(v<<1|1, tm + 1, tr, max(tm + 1, l), r);
    if(l_ans == -1)
        return r_ans;
    if(r_ans == -1)
        return l_ans;
    if(a[l_ans] >= a[r_ans])
        return l_ans;
    else
        return r_ans;
}

void rec(int l, int r, int deep = 0){
    if (l > r)
        return;
    if(l == r){
        d[l] = deep;
        return;
    }
    int mx_ind = get(1, 0, n - 1, l, r);
    d[mx_ind] = deep;
    rec(l, mx_ind - 1, deep + 1);
    rec(mx_ind + 1, r, deep + 1);
}

int32_t main()
{
    ios::sync_with_stdio(false);
    int q;
    cin >> q;
    while(q--){
        cin >> n;
        for(int i = n; i < 2 * n; i++) {
            cin >> a[i - n];
            t[i] = i - n;
        }
        build(1, 0, n - 1);
        rec(0, n - 1);
        for(int i = 0; i < n; i++)
            cout << d[i] << ' ';
        cout << '\n';
    }
}