/**/
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <limits>
#include <time.h>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
using namespace std;
/***********************************************/
/* Dear online judge:
 * I've read the problem, and tried to solve it.
 * Even if you don't accept my solution, you should respect my effort.
 * I hope my code compile and get accepted.
 *      ____________
 *     /            \
 *    /  /\      /\  \
 *   /  /  \    /  \  \
 *   \                /
 *    \     \___/    /
 *     \____________/
 */
const long long mod = 1000000007;
long long dp[100010];
long long f[100010];
int main() {
    ios_base::sync_with_stdio(false);
    //cin.tie(nullptr);

    int T;
    cin>>T;
    while(T--){
        int N;
        cin>>N;
        vector<int> a(N);
        for(int i = 0;i < N;i++)
            cin>>a[i],dp[i] = INT_MAX;
        for(int i = 0;i < N;i++){
            int t = lower_bound(dp,dp+N,a[i]) - dp;
            f[i] = t;
            dp[t] = a[i];
        }
        for(int i = 0;i < N;i++)
            cout<<f[i]+1<<" \n"[i+1==N];
    }
    return 0;
}
/**/