#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;

typedef long long LL;
typedef vector<int> VI;

#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_end;++i)
#define eprintf(s...) fprintf(stderr, s)

template<class T> inline void amin(T &a, const T &b) { if (b<a) a=b; }
template<class T> inline void amax(T &a, const T &b) { if (a<b) a=b; }

template<class T>
struct Fenwick : vector<T> {
    typedef vector<T> S;
    int N;
    Fenwick(int N_=0): S(N_), N(N_) {}
    void add(int i, T x) {
    for (; i<N; i|=i+1) S::operator[](i) += x;
    }
    inline T sum(int r) {
    T s = 0;
    for (; r; r&=r-1) s += S::operator[](r-1);
    return s;
    }
    T sum(int l, int r) {
    return sum(r) - sum(l);
    }
    int lower_bound(T x) { // argmin_i x <= sum(0,i)
    int i = 1, j = 0;
    T s = T();
    while (i<N) i<<=1;
    for (; i; i>>=1) {
        if (i+j <= N && s + S::operator[](i+j-1) < x) {
        s += S::operator[](i+j-1);
        j += i;
        }
    }
    return j;
    }
};

int T, N;
int A[50011], ans[50011];

int main() {
    scanf("%d", &T);
    REP ($, T) {
    scanf("%d", &N);
    REP (i, N) scanf("%d", A+i);

    Fenwick<int> F(N);
    REP (i, N) F.add(i, 1);
    
    for (int i=N-1; i>=0; i--) {
        int d = A[i] - (i?A[i-1]:0);
        int guess = i - d;
        ans[i] = F.lower_bound(guess + 1);
        F.add(ans[i], -1);
    }
    REP (i, N) printf("%d%c", ans[i] + 1, i==N-1?'\n':' ');
    
    }
    return 0;
}