#include<stdio.h>
#include<math.h>
#include<stdlib.h>
#include<algorithm>
#include<string.h>
#include<vector>
int a[60010];
const int maxn = 2e5+6;  
int lowbit[maxn],tree[maxn]; 
int ans[60010];
void GetLowbit()  
{  
    for(int i=1;i<maxn;i++)  
        lowbit[i]=i&-i;  
}  
void update(int x,int v)  
{  
    for(int i=x;i<maxn && i;i+=lowbit[i])  
        tree[i]+=v;  
}  
int query(int x)  
{  
    int ret(0);  
    for(int i=x;i>0;i-=lowbit[i])  
        ret+=tree[i];  
    return ret;  
}  
int Find(int x,int n)  
{  
    int ret=1e9,down=1,mid,up=n,v;  
    while(down<=up)  
    {  
        mid=(down+up)>>1;  
        v=query(mid);  
        if(v>=x)  
        {  
            up=mid-1;  
            if(mid<ret && x==v)  
                ret=mid;  
        }  
        else  
            down=mid+1;  
    }  
    return ret;  
}  
using namespace std;
int main()
{
    int i,j,k,n,m,t;
    int tt;
    scanf("%d",&tt);
    GetLowbit();  
    while(tt--)
    {
        memset(tree,0,sizeof(tree));  
        scanf("%d",&n);
        for(i=1;i<=n;i++)
        update(i,1);  
//        printf("min=%d \n",Find((1),n));
//        printf("min=%d \n",Find((2),n));
//        printf("min=%d \n",Find((3),n));
        for(i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
        }
        int tmp=n;
        for(i=n-1;i>=0;i--)
        {
            if(i>=1)t=a[i]-a[i-1];
            else t=a[i];
            //printf("%d %d %d\n ",t+1, tmp+1-(t+1),Find(tmp+1-(t+1),n));
        
            //system("pause");
            ans[i] = Find(tmp+1-(t+1),n);
            tmp--;
            update(ans[i],-1); 
        }
        printf("%d",ans[0]);
        for(i=1;i<=n-1;i++)
        printf(" %d",ans[i]);
        printf("\n");
    }
    
    return 0;
}