/**
 * Dec 5, 2015 8:39:53 PM
 * PrjName: 1205-03-2
 * @semprathlon
 */
import java.io.*;
import java.util.*;
public class Main {
    static int[] a,f;
    static BIT tr;
    static HashSet<Integer> st=new HashSet<Integer>();
    static void print(int[] a,PrintWriter out){
        int n=a.length-1;
        for(int i=1;i<=n;i++)
            out.print(a[i]+(i<n?" ":""));
        out.println();
    }
    public static void main(String[] args) throws IOException{
        InputReader in=new InputReader(System.in);
        PrintWriter out=new PrintWriter(System.out);
        int T=in.nextInt();
//        tr=new BIT(5);
//        out.print(tr.lowbit(2));
        while(T-->0){
            int n=in.nextInt();
            a=new int[n+1];
            f=new int[n+1];
            tr=new BIT(n);
            for(int i=1;i<=n;i++){
                f[i]=in.nextInt();
                tr.add(i, 1);
            }
            
            for(int i=n;i>=1;i--){
                f[i]-=f[i-1];
                int tmp=tr.find(i-f[i]-1);
//                out.println(i+","+f[i]+","+tmp);
                a[i]=tmp;
                tr.add(tmp, -1);
            }
            print(a, out);
        }
        out.flush();
        out.close();
    }
}
class BIT{
    int[] data;
    int sz;
    BIT(){}
    BIT(int _sz){
        sz=_sz;
        data=new int[sz+1];
    }
    int lowbit(int x){
        return x&(-x);
    }
    void add(int p,int v){
        while(p<=sz){
            data[p]+=v;
            p+=lowbit(p);
        }
    }
    int sum(int p){
        int res=0;
        while(p>0){
            res+=data[p];
            p-=lowbit(p);
        }
        return res;
    }
    int find(int p){
        int l=1,r=sz;
        while(l<r){
            int mid=(l+r)>>1;
            if (sum(mid)<=p)
                l=mid+1;
            else
                r=mid;
        }
        
        return l;
    }
}

/**
 * Dec 6, 2015 4:42:31 PM
 * PrjName: 1205-03-3
 * @semprathlon
 */
import java.io.*;
import java.util.*;
public class Main {
    static int[] a,f;
    static ST tr;
    static HashSet<Integer> st=new HashSet<Integer>();
    static void print(int[] a,PrintWriter out){
        int n=a.length-1;
        for(int i=1;i<=n;i++)
            out.print(a[i]+(i<n?" ":""));
        out.println();
    }
    public static void main(String[] args) throws IOException{
        InputReader in=new InputReader(System.in);
        PrintWriter out=new PrintWriter(System.out);
        int T=in.nextInt();
        while(T-->0){
            int n=in.nextInt();
            a=new int[n+1];
            f=new int[n+1];
            tr=new ST(n);
            tr.build(1, 1, n);
            for(int i=1;i<=n;i++)
                f[i]=in.nextInt();
            
            for(int i=n;i>=1;i--){
                f[i]-=f[i-1];
                int tmp=tr.query(1, 1, n, f[i]+1);
//                out.println(i+","+f[i]+","+tmp);
                a[i]=tmp;
                
            }
            print(a, out);
        }
        out.flush();
        out.close();
    }
}
class ST{
    int[] l,r,m,v;
    int sz;
    ST(){}
    ST(int _sz){
        sz=_sz<<2;
        l=new int[sz];
        r=new int[sz];
        m=new int[sz];
        v=new int[sz];
    }
    void build(int k,int x,int y){
        l[k]=x;r[k]=y;m[k]=(x+y)>>1;
        if (x<y){
            build(k<<1,x,m[k]);
            build(k<<1|1,m[k]+1,y);
        }
        v[k]=y-x+1;
    }
    int query(int k,int x,int y,int q){
        if (l[k]==r[k]){
            v[k]=0;
            return l[k];
        }
        int res=0;
        if (v[k<<1|1]>=q)
            res=query(k<<1|1, m[k]+1, y, q);
        else
            res=query(k<<1,x,m[k],q-v[k<<1|1]);
        v[k]=v[k<<1]+v[k<<1|1];
        return res;
    }
    
}

/**
 * Nov 28, 2015 8:04:23 PM
 * PrjName: Bc64-02
 * @semprathlon
 */
import java.io.*;
import java.util.*;
public class Main {
    static int[] a,s,f;
    static int fn(int x){
        return (1890*x+143)%10007;
    }
    public static void main(String[] args) throws IOException{
        InputReader in=new InputReader(System.in);
        PrintWriter out=new PrintWriter(System.out);
        while(in.nextLine()!=null){
            int n=in.nextInt();
            a=new int[n+1];
            s=new int[n+1];
            f=new int[n+1];
            for(int i=1;i<=n;i++){
                a[i]=in.nextInt();
                s[i]=s[i-1]+a[i];
            }
            int ans=s[n];
            for(int i=1;i<=n;i++){
                f[i]=Math.max(f[i-1]+fn(a[i]), s[i]);
                ans=Math.max(ans, f[i]+s[n]-s[i]);
            }
            out.println(ans);
        }
        out.flush();
        out.close();
    }

}