/*
ID: jsnjhcb1
PROG: b_
LANG: C++
*/
/*************************************************************************
    > File Name: b_.cpp
    > Author: UCU
    > Mail: jsnjhcb@icloud.com
    > Created Time: 六  7/23 19:24:48 2016
 ************************************************************************/

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cctype>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<string>
#include<cstdlib>
#include<queue>
#include<cmath>
#include<iomanip>
#include<climits>
#include<fstream>
using namespace std;
int a[100010];
int h[100010];
int ans[100010];
int main(){
    int T;
    scanf("%d",&T);
    while(T--){
        int n;
        scanf("%d",&n);
        for(int i=0;i<n;++i){
            scanf("%d",a+i);
        }
        h[0] = a[0];
        ans[0] = 1;
        int top = 0;
        for(int i=1;i<n;++i){
            if(a[i] > h[top]){
                h[top + 1] = a[i];
                ans[i] = top + 2;
                top++;
            }
            else{
                int l = 0, r = top;
                int tmp = r;
                while(l <= r){
                    int mid = (l + r) / 2;
                    if(h[mid] == a[i]){
                        tmp = mid;
                        break;
                    }
                    else if(h[mid] > a[i]){
                        tmp = mid;
                        r = mid - 1;
                    }
                    else{
                        l = mid + 1;
                    }
                }
                h[tmp] = a[i];
                ans[i] = tmp + 1;
            }
        }
        for(int i=0;i<n;++i){
            printf("%d",ans[i]);
            if(i==n-1){
                printf("\n");
            }
            else {
                printf(" ");
            }
        }
    }
    return 0;
}