#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1e5 + 5;
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int T;
	cin >> T;
	while(T--){
		int n;
		cin >> n;
		vector<int> a(n + 1);
		for(int i = 1; i <= n; i++) cin >> a[i];
		vector<int> d = a;
		sort(a.begin() + 1, a.end());
		int cnt = unique(a.begin() + 1, a.end()) - a.begin() - 1;
		for(int i = 1; i <= n; i++){
			d[i] = lower_bound(a.begin() + 1, a.begin() + cnt + 1,
			 d[i]) - a.begin();
		}
		for(int i = 1; i <= n; i++){
			cout << d[i] << " "; 
		}
		cout << endl;
	}
	return 0;
}