#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
using namespace std;
const int N=50005;
int n,a[N],p[N],tr[N],fa[N],x,T,l,r,mid;

int lowbit(int x)
{
    return x&-x;
}

void add(int x)
{
    for (;x<=n;x+=lowbit(x)) tr[x]++;
}

int get(int x)
{
    int sum=0;
    for (;x;x-=lowbit(x)) sum+=tr[x];
    return sum;
    
}

int GET(int x)
{
    if (fa[x]==x) return x; else return fa[x]=GET(fa[x]);
}

bool check()
{
    for (int i=1;i<=n;i++)
    {
        int sum=0;
        for (int j=1;j<i;j++) if (p[i]<p[j]) sum++;
        if (sum!=a[i]-a[i-1]) return 0;
    }
    return 1;
}

int main()
{
    cin>>T;
    while (T--)
    {
        memset(tr,0,sizeof(tr));
        cin>>n;
        for (int i=1;i<=n;i++) scanf("%d",&a[i]),fa[i]=i;
        for (int i=n;i;i--)
        {
            l=x=i-(a[i]-a[i-1]); r=n;
            while (l<r)
            {
                mid=(l+r)/2;
                if (get(mid)+x<=mid) r=mid; else l=mid+1;
            }
            x=l;
            x=GET(x);
            p[i]=x; fa[x]=x+1; add(x);
        }
        for (int i=1;i<=n;i++) printf("%d%c",p[i],i==n?'\n':' ');
    }
}