description: You are given three integers n, a, b. Determine if there exists a permutation p_1, p_2, …, p_n of integers from 1 to n, such that:
  
    * There are exactly a integers i with 2 ≤ i ≤ n-1 such that p_{i-1} < p_i > p_{i+1} (in other words, there are exactly a local maximums).
  
    * There are exactly b integers i with 2 ≤ i ≤ n-1 such that p_{i-1} > p_i < p_{i+1} (in other words, there are exactly b local minimums).
  
  
  
  
  If such permutations exist, find any such permutation.
  
  Input
  
  The first line of the input contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases. The description of test cases follows.
  
  The only line of each test case contains three integers n, a and b (2 ≤ n ≤ 10^5, 0 ≤ a,b ≤ n).
  
  The sum of n over all test cases doesn't exceed 10^5.
  
  Output
  
  For each test case, if there is no permutation with the requested properties, output -1.
  
  Otherwise, print the permutation that you are found. If there are several such permutations, you may print any of them.
  
  Example
  
  Input
  
  
  3
  4 1 1
  6 1 2
  6 4 0
  
  
  Output
  
  
  1 3 2 4
  4 2 3 1 5 6
  -1
  
  Note
  
  In the first test case, one example of such permutations is [1, 3, 2, 4]. In it p_1 < p_2 > p_3, and 2 is the only such index, and p_2> p_3 < p_4, and 3 the only such index.
  
  One can show that there is no such permutation for the third test case.
solution: // Piyush Nagpal
  import java.util.*;
  import java.io.*;
   public class C{
       
      static int MOD=1000000007;
      static PrintWriter pw;
      static FastReader sc;
      
      static class FastReader {
          BufferedReader br;
          StringTokenizer st;
   
          public FastReader()
          {
              br = new BufferedReader(
                  new InputStreamReader(System.in));
          }
   
          String next()
          {
              while (st == null || !st.hasMoreElements()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  }
                  catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
   
          int nextInt() { return Integer.parseInt(next()); }
   
          long nextLong() { return Long.parseLong(next()); }
   
          double nextDouble(){return Double.parseDouble(next());}
          
          public char nextChar() throws IOException {return next().charAt(0);}
   
          String nextLine(){
              String str = "";
              try {
                  str = br.readLine();
              }
              catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
          public int[] intArr(int a,int b,int n) throws IOException {int[]in=new int[n];for(int i=a;i<b;i++)in[i]=nextInt();return in;}
          public long[] longArr(int a,int b,int n) throws IOException {long[]in=new long[n];for(int i=a;i<b;i++)in[i]=nextLong();return in;}
          public ArrayList<Integer> intlist(int n)throws IOException {ArrayList<Integer> list= new ArrayList<>();for(int i=0;i<n;i++)list.add(nextInt());return list;}
          public ArrayList<Long> longlist(int n)throws IOException {ArrayList<Long> list= new ArrayList<>();for(int i=0;i<n;i++)list.add(nextLong());return list;}
      }   
   
   
       public static long gcd(long a,long b){if( b>a ){return gcd(b,a);}if( b==0 ){return a;} return gcd(b,a%b);}
       public static long expo( long a,long b,long M ){long result=1;while(b>0){if( b%2==1 ){result=(result*a)%M;}a=(a*a)%M;b=b/2;}return result%M;}
      public static ArrayList<Long> Sieve(int n){boolean [] arr= new boolean[n+1];Arrays.fill(arr, true);ArrayList<Long> list= new ArrayList<>();for(int i=2;i<=n;i++){if( arr[i]==true ){list.add((long)i);}for(int j=2*i;j<=n;j+=i){arr[j]=false;}}return list;}
   
      public static void parr(int [] arr){for(int i=0;i<arr.length;i++){pw.print(arr[i]+" ");}}
      public static void parr(long [] arr){for(int i=0;i<arr.length;i++){pw.print(arr[i]+" ");}}
      public static void plist(ArrayList<Integer> list){for(int i=0;i<list.size();i++){pw.print(list.get(i)+" ");}}
      public static void pllist(ArrayList<Long> list){for(int i=0;i<list.size();i++){pw.print(list.get(i)+" ");}}
      
      // int [] arr=sc.intArr(a,b,n);  <b
      static void solve() throws Exception{
         int n=sc.nextInt(),a=sc.nextInt(),b=sc.nextInt();
         int max=0,min=0;
         if(n%2==0){
              max=min=n/2;
         }else{
              max=n/2;
              min=(n/2)-1;
         }
  
         // -1
  
         if( (a+b)>(n-2) || Math.abs(a-b)>1 ){
              pw.println("-1");
              return;
         }
  
         ArrayList<Integer> list= new ArrayList<>();
  
         for(int i=1;i<=n;i++){
              list.add(i);
         }
  
         if(a==b){
              if(a>0){
                  for(int i=1;i<list.size()-1;i+=2){
                      swap(list,i,i+1);
                      a--;
                      if(a==0){
                          break;
                      }
                  }
  
              }
         }else if(a>b){
              // last swap
              swap(list,list.size()-1,list.size()-2);
              a--;
              if(a>0){
                  for(int i=1;i<list.size()-2;i+=2){
                      swap(list,i,i+1);
                      a--;
                      if(a==0){
                          break;
                      }
                  }
              }    
         }else if(b>a){
              int temp=list.get(0);
              list.set(0,list.get(1));
              list.set(1,temp);
              b--;
              if(b>0){
                  for(int i=2;i<list.size()-1;i+=2){
                      swap(list,i,i+1);
                      b--;
                      if(b==0){
                          break;
                      }
                  }
              }    
         }
         plist(list);
         pw.println();
  }
  
  public static void swap(ArrayList<Integer> list,int i,int j){
          int temp=list.get(j);
          list.set(j,list.get(i));
          list.set(i,temp);
      }
  
     public static void main(String[] args) throws Exception{
          try {
              System.setIn(new FileInputStream("input.txt"));
              System.setOut(new PrintStream(new FileOutputStream("output.txt")));
          } catch (Exception e) {
              System.err.println("Error");
          }
          sc= new FastReader();
          pw = new PrintWriter(System.out);
  
          int tc=1;
          tc=sc.nextInt();
          for(int i=1;i<=tc;i++) {
             // pw.printf("Case #%d: ", i);
              solve();
          }
         
          pw.flush();
   
      
   
      }
   
  }