#include<bits/stdc++.h>

using namespace std;

const int MAXN = 10002;

int n;
int p[MAXN], col[MAXN], L[MAXN], R[MAXN];

bool mark[MAXN];

inline void construct(int c, vector<int> now){
	if(c==25 || now.size()==0) return ;	
	for(int i=1;i<=n;++i) mark[i]=0;
	for(auto i:now) mark[i]=1; int cur=0; L[0]=R[0]=0;
	for(int i=1;i<=n;++i) L[i]=cur, cur=mark[i]?i:cur; cur=0;
	for(int i=n;i>=1;--i) R[i]=cur, cur=mark[i]?i:cur;
	reverse(now.begin(),now.end()); vector<int> nxt;
	for(auto i:now){
		if(!mark[i]) nxt.push_back(i);
		else{
			mark[L[i]]=mark[R[i]]=0; col[i]=c;
			R[L[i]]=R[i], L[R[i]]=L[i]; mark[i]=0;
		}
	}
	reverse(nxt.begin(),nxt.end());
	construct(c+1,nxt);
	return ;
}

inline void solve(){
	cin >> n;
	for(int i=1;i<=n;++i) cin >> p[i];
	vector<int> now; for(int i=1;i<=n;++i) now.push_back(p[i]);
	construct(1,now);
	for(int i=1;i<=n;++i) cout << col[i] << ' '; cout << endl;
	return ;
}

int main(){
	int t; cin >> t;
	while(t--) solve();
	return 0;
}