#include<iostream>
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int a[N];
vector<int>b;

int find(int x) {
    int l = 0, r = b.size() - 1;
    while (l < r) {
        int mid = l + r >> 1;
        if (b[mid] > x) r = mid;
        else    l = mid + 1;
    }
    if (x != b[b.size() - 1])
        return r;
    else
        return r + 1;
}

int main()
{
    ios::sync_with_stdio(false);
    int T;
    cin >> T;
    while (T--) {
        int n;
        cin >> n;
        for (int i = 1; i <= n; i++) {
            cin >> a[i];
            b.push_back(a[i]);
        }
        b.erase(unique(b.begin(), b.end()), b.end());//去重
        sort(b.begin(),b.end());
        for (int i = 1; i <= n; i++) {
            cout << find(a[i]) << ' ';
        }
        cout << endl;
        b.clear();//注意清空重来
    }
    return 0;
}