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: import java.io.BufferedReader; 
  import java.io.IOException; 
  import java.io.InputStreamReader; 
  import java.util.Scanner; 
  import java.util.StringTokenizer;
  import java.util.*;
  public class codeforcesB{
   public 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()); 
          } 
   
          String nextLine() 
          { 
              String str = ""; 
              try
              { 
                  str = br.readLine(); 
              } 
              catch (IOException e) 
              { 
                  e.printStackTrace(); 
              } 
              return str; 
          } 
     } 
   public static int f(int a[],int b[]){return b[0]-a[0];}
   public static void main(String args[]){
      FastReader sc=new FastReader();
      int t=sc.nextInt();
      while(t-->0){
        int n=sc.nextInt();
        int a=sc.nextInt();
        int b=sc.nextInt();
        boolean flag=true;
        if(a+b>n-2 || Math.abs(a-b)>1){flag=false;}
        if(flag){
       StringBuilder sb=new StringBuilder();
            if(a>b){
                int ar[]=new int[n];
                int x=n;
                int index=1;
                for(int i=0;i<a;i++){
                     ar[index]=x;index+=2;x--;
                  }
                for(int i=0;i<n;i++){
                   if(ar[i]==0){ar[i]=x;x--;}sb.append(ar[i]+" ");
                  }  
          
              }
              else{
                if(b>a){
                  int ar[]=new int[n];
                int x=1;
                int index=1;
                for(int i=0;i<b;i++){
                     ar[index]=x;index+=2;x++;
                  }
                for(int i=0;i<n;i++){
                   if(ar[i]==0){ar[i]=x;x++;}sb.append(ar[i]+" ");
                  }  
                  
                  }
                else{
                  int ar[]=new int[n];
                  int x=1;
                  int  index=0;
                  for(int i=0;i<b+1;i++){ar[index]=x;index+=2;x++;}
                  for(int i=0;i<n;i++){if(ar[i]==0){ar[i]=x;x++;}sb.append(ar[i]+" ");}
                  
                  
                  
                  
                  }
              }
              System.out.println(sb.toString());
          }
      else{System.out.println("-1");}
     }
  }
  }