#include<bits/stdc++.h>   using namespace std;      #define ll          long long   #define int         ll   #define ld          long double   #define ff          first   #define ss          second   #define io          ios_base::sync_with_stdio(false); cin.tie(NULL);   #define yes         cout<< YES    #define no          cout<< NO    #define loop(i,a,n) for(int i=a;i<n;i++)   #define rloop(i,n,a)for(int i=n-1;i>=a;i--)   #define test        int tt=1; cin>>tt; while(tt--)   #define pb          push_back   #define pi          3.141592653589793238   #define all(v)      v.begin(),v.end()   #define vecl        vector<int>   #define pii         pair<int,int>   #define vpii        vector<pii>   const int MOD = 1e9 + 7;   int fast_expo(int x, int p) {       if (p == 0) return 1;       else if (p % 2 == 0) { int t = fast_expo(x, p / 2) % MOD; return (t * t) % MOD;}       else return (x * (fast_expo(x, p - 1)) % MOD) % MOD;   }   int gcd(int a, int b) {       if (a == 0 || b == 0) return a + b;       else return gcd(b % a, a);   }      int lcm(int a, int b)   {       return (a * b) / gcd(a, b);   }   vecl v;   void primeFactors(int n)   {       // Print the number of 2s that divide n       while (n % 2 == 0)       {           v.pb(2);           n = n / 2;       }          // n must be odd at this point. So we can skip       // one element (Note i = i +2)       for (int i = 3; i <= sqrt(n); i = i + 2)       {           // While i divides n, print i and divide n           while (n % i == 0)           {               v.pb(i);               n = n / i;           }       }          // This condition is to handle the case when n       // is a prime number greater than 2       if (n > 2)           v.pb(n);   }   //int t[101][101];   void calc(vecl &a, int l, int r, vecl &b, int d)   {       if (l >= r)           return;          int mx = 0, ans = 0;       loop(i, l, r)       {           mx = max(mx, a[i]);       }       loop(i, l, r)       {           if (mx == a[i])           {               ans = i; break;           }       }       b[ans] = d;       calc(a, ans + 1, r, b, d + 1);       calc(a, l, ans, b, d + 1);   }      void solve()   {       int n;       cin >> n;       vecl a(n);       loop(i, 0, n)       {           cin >> a[i];       }       //memset(t,-1, sizeof t);       int l = 0, r = n;       vecl ans(n + 1, 0);       int d = 0;       calc(a, l, r, ans, d);       loop(i, 0, n)       cout << ans[i] <<    ;   }      signed main() {          io   #ifndef ONLINE_JUDGE       freopen( inputf.in ,  r , stdin);       freopen( outputf.out ,  w , stdout);   #endif       //calc();       test       {           solve();           cout << endl;       }       return 0;   }