#include<bits/stdc++.h>
using namespace std;
#define int  long long
int m;
void solve(){
	int n;
	cin>>n;
	vector<int> s(n),x(n);
	for(int j=1;j<=n;j++){
		cin>>s[j];
		x[j]=s[j];
	}
	sort(x.begin(),x.end());
	x.erase(unique(x.begin(),x.end()),x.end());
	for(int i=1;i<=n;i++){
		cout<<lower_bound(x.begin(),x.end(),s[i])-x.begin()+1<<" ";
	}
	cout<<endl;
	return;
}
signed main(){
	cin>>m;
	for(int i=1;i<=m;i++){
		solve();
	}
	return 0;
}