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.util.*;
  import java.io.*;
  public class Main {
     // For fast input output
     static class FastReader {
         BufferedReader br;
         StringTokenizer st;
         public FastReader()
         { try {br = new BufferedReader(
         new FileReader("input.txt"));
         PrintStream out = new PrintStream(new FileOutputStream("output.txt"));
         System.setOut(out);}
         catch(Exception e) { 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;
         }
     }
      // end of fast i/o code
      public static void main(String[] args) {
          FastReader reader = new FastReader();
          StringBuilder sb = new StringBuilder("");
          
          int t = reader.nextInt();
          while(t-->0){
              int n = reader.nextInt();
              int a = reader.nextInt();
              int b = reader.nextInt();
              int arr[] = new int[n];
              Arrays.fill(arr, -1);
              int temp_a=a, temp_b = b;
  
              if(a==0 && b==0){
                  for(int i=0; i<n; i++){
                      arr[i] = i+1;
                  }
                  for(int start = 0; start<n; start++){
                      sb.append(arr[start]+" ");
                  }
                  sb.append("\n");
                  continue;
              }
  
              if((int)(Math.abs(a-b))>1 || a+b>n-2){
                  sb.append("-1\n");
                  continue;
              }
              
              if(b>=a){
                  // filling all b
                  int num = 1;
                  int start = 1;
                  while(b-- > 0){
                      arr[start] = num++;
                      start += 2;
                  }
                  // filling all a
                  start = 2;
                  num = n;
                  while(a-- > 0){
                      arr[start] = num--;
                      start += 2;
                  }
                  if(temp_b>temp_a){
                      num = temp_b + 1;
                      for(start = 0; start<n; start++){
                          if(arr[start]==-1){
                              arr[start] = num++;
                          }
                      }
                  }else{
                      num = temp_b + 1;
                      arr[0] = temp_b + 1;
                      num = n - temp_a;
                      for(start=1+temp_a+temp_b; start<n; start++){
                          arr[start] = num--;
                      }    
                  }
              }else{
                  // filling all a
                  int num = n;
                  int start = 1;
                  while(a-- > 0){
                      arr[start] = num--;
                      start += 2;
                  }
                  // filling all b
                  start = 2;
                  num = 1;
                  while(b-- > 0){
                      arr[start] = num++;
                      start += 2;
                  }
                  num = temp_b + 1;
                  arr[0] = temp_b + 1;
                  num = n - temp_a;
                  for(start=1+temp_a+temp_b; start<n; start++){
                      arr[start] = num--;
                  }
              }
  
              for(int start = 0; start<n; start++){
                  sb.append(arr[start]+" ");
              }
  
              sb.append("\n");
          }
          System.out.println(sb);
      }
  }