#include<iostream>
#include<stdio.h>
#include<math.h>
#include<iomanip>
#include<string>
#include<algorithm>
#include <cstdlib>
#include<stdlib.h>
#include<sstream>
#include<stack>
#include <climits>
#include<vector>
using namespace std;

vector <long long>a;
vector <long long>b;
int main() 
{
	int t,n;
	cin >> t;
	long long p;
	for (int i = 0; i < t; i++)//数据组数
	{
		scanf_s("%d", &n);//每组数字个数
		for (int j = 0; j < n; j++)//存储数据
		{
			scanf_s("%llu", &p);
			a.push_back(p);
		}
		b = a;//备份
		sort(a.begin(),a.end());//排序
		unique(a.begin(), a.end());//去重
		for (int j = 0; j < n; j++)//计数
		{
			int count = 1;
			int k = 0;
			while (b[j] != a[k])
			{
				count++;
				k++;
			}
			cout << count << " ";
		}
		cout << "\n";
		a.clear();
		b.clear();
	}
	return 0;
}