#include <iostream>
#include <vector>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <utility>

using namespace std;


typedef int keyType ;

struct Node{
    keyType key ; // elements in node

    int priority , 
        size ; // size : size of the tree, which has this node as a Root.

    Node *left, *right ; // children

    Node (const keyType& _Key) : key(_Key), priority (rand()), size(1), left(NULL), right(NULL)
    {}

    void calcsize(){
        size = 1;
        if(left) size +=  left->size ;
        if(right) size +=right->size ;
    }

    void setLeft (Node* newl){
        left = newl ;
        calcsize() ;
    }
    void setRight(Node* newr){
        right= newr ;
        calcsize() ;
    }
};

typedef pair<Node*,Node*> nodePair ;

nodePair split(Node* root, keyType key){
    if(root == NULL) return nodePair(NULL,NULL);

    //루트가 key 미만이면 right sub tree 를 split
    if(root->key < key){
        nodePair rs = split(root->right , key);
        root->setRight(rs.first) ;
        return make_pair(root, rs.second) ;//////////////////////////////////////
    }

    //루트가 key 이상이면 왼쪽 서브트리를 쪼갠다
    nodePair ls = split(root->left , key) ;
    root->setLeft(ls.second) ;
    return make_pair(ls.first , root) ;//////////////////////////////////
}
//이 함수는 이렇게 쓰세요 : root = insert(root, new Node(키값)) ;
Node* insert(Node* root, Node* node){
    if(root == NULL) return node;
    // 루트를 교체하는 경우
    if(root->priority < node->priority){
        nodePair splitted = split(root, node->key );
        node->setLeft(splitted.first) ;
        node->setRight(splitted.second) ;
        return node ;
    }
    else if(node -> key < root->key){
        root -> setLeft(insert(root->left , node));
    }
    else
        root->setRight(insert(root->right , node));

    return root ;
}

//노드 삭제 및 합치기 연산
Node* merge(Node* a, Node* b){
    if(a==NULL) return b;
    if(b==NULL) return a;
    if(a->priority < b->priority){
        b->setLeft(merge(a , b->left));
        return b;
    }
    a->setRight(merge(a->right , b) );
    return a;
}

Node* erase (Node* root, keyType key){
    if(root == NULL) return root;
    if(root->key == key){
        Node* ret = merge(root->left , root->right) ;
        delete root ;
        return ret ;
    }
    if (key < root->key)
        root->setLeft(erase(root->left , key)) ;
    else
        root->setRight(erase(root->right,key)) ;
    return root;
}

Node* kth(Node* root,int k){
    int leftSize = 0;
    if(root->left != NULL) leftSize = root->left->size ;

    if(k <= leftSize) return kth(root->left , k);
    if(k == leftSize+1)return root ;
    return kth(root->right , k - leftSize-1) ;
}
int countLessThan(Node* root, keyType key){
    if(root == NULL) return 0;
    if(root->key >= key)
        return countLessThan (root->left , key) ;
    int ls = (root->left ? root->left->size : 0);
    return ls + 1 + countLessThan(root->right, key) ;
}


int shift[50001] ;
int first[50001] ;

int main (){
    srand((unsigned)time(NULL));
int tc ; cin>>tc ;
while(tc--){
    int n;
    scanf("%d",&n) ;
    Node* rt = NULL ;

    for(int i=0;i<n;++i){
        scanf("%d",&shift[i]) ;
        rt = insert(rt,new Node(i+1) );
    }

    for(int i = n-1; i >= 0 ; --i){
        int k = i - shift[i] + 1 ;
        Node* tmp = kth(rt , k) ;
        int Erase = tmp->key ;
        first[i] = Erase ;
        rt = erase(rt , Erase) ; 
        //답을 구해염
    }

    for(int i=0;i<n;++i){
        printf("%d ",first[i]) ;
    }printf("\n") ;

    //delete rt ;
}
    return 0;
}