#include <algorithm>
#include <iostream>
#include <cstring>
#include <vector>
#include <cstdio>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <complex>
#include <bitset>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define de(x) cout << #x << "=" << x << endl
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
int T , n , a[101010] , b[101010] , c[101010] , _;
vi V;
#define lb(x) (x&(-x))
int Max(int x){
    int r=0;
    for(int i=x;i>=1;i-=lb(i)) r=max(b[i],r);
    return r;
}
void add(int x,int r){
    for(int i=x;i<sz(V);i+=lb(i)) b[i]=max(b[i],r);
}

int main(){
    scanf("%d",&T);
    rep(i,0,T){
        scanf("%d",&n);
        V.clear();
        rep(i,0,n) scanf("%d",a + i) , V.pb(a[i]);
        sort(all(V));V.erase(unique(all(V)),V.end());
        fill(b,b+sz(V)+1,0);
        _ = 0;
        rep(i,0,n){
            int x = lower_bound(all(V),a[i]) - V.begin() + 1;
            c[i] = Max(x-1)+1;
            add(x,c[i]);
        }
        rep(i,0,n) printf("%d%c",c[i]," \n"[i+1==n]);
    }
    return 0;
}