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.*;
  import java.util.*;
  
  public class B {
  
      public static void main(String[] args) {
          new B().run();
      }
  
      BufferedReader br;
      PrintWriter out;
  
      long mod = (long) (1e9 + 7), inf = (long) (3e18);
  
      class pair {
          int F, S;
          pair(int f, int s) {
              F = f;  S = s;
          }
      }
  
      void solve() {
          int t = ni();
          while(t-- > 0) {
              //TODO: 
              int n= ni();
              int a= ni();
              int b=ni();
  
              int l=1, r=n;
  
              ArrayList<Integer> ans=new ArrayList<>();
  
              if((a+b)>n-2 || Math.abs(a-b)>1){
                  out.println("-1");
                  continue;
              }
  
              if(a==b){
                  int h=0;
                  ans.add(l);
                  l++;
                  while(h<a){
                      ans.add(r);
                      r--;
                      ans.add(l);
                      l++;
                      h++;
                  }
  
                  for(int i=l; i<=r; i++){
                      ans.add(i);
                  }
  
              }
              else if(a>b){
                  int h=0;
                  ans.add(l);
                  l++;
                  while(h<a-1){
                      ans.add(r);
                      r--;
                      ans.add(l);
                      l++;
                      h++;
                  }
  
                  for(int i=r; i>=l; i--){
                      ans.add(i);
                  }
  
              }
              else{
                  ans.add(r);
                  r--;
  
                  int v=0;
                  while(v<b-1){
                      ans.add(l);
                      l++;
                      ans.add(r);
                      r--;
                      v++;
                  }
  
                  for(int i=l; i<=r; i++){
                      ans.add(i);
                  }
              }
  
  
              for(int e: ans){
                  out.print(e+" ");
              }
              out.println();
  
          }
      }
  
  // -------- I/O Template -------------
  
      char nc() {
          return ns().charAt(0);
      }
  
      String nLine() {
          try {
              return br.readLine();
          } catch(IOException e) {
              return "-1";
          }
      }
  
      double nd() {
          return Double.parseDouble(ns());
      }
  
      long nl() {
          return Long.parseLong(ns());
      }
  
      int ni() {
          return Integer.parseInt(ns());
      }
  
      int[] na(int n) {
          int a[] = new int[n];
          for(int i = 0; i < n; i++)  a[i] = ni();
          return a;
      }
  
      StringTokenizer ip;
  
      String ns() {
          if(ip == null || !ip.hasMoreTokens()) {
              try {
                  ip = new StringTokenizer(br.readLine());
                  if(ip == null || !ip.hasMoreTokens())
                  ip = new StringTokenizer(br.readLine());
              } catch(IOException e) {
                  throw new InputMismatchException();
              }
          }
      return ip.nextToken();
      }
  
      void run() {
          try {
              if (System.getProperty("ONLINE_JUDGE") == null) {
                  br = new BufferedReader(new FileReader("/media/ankanchanda/Data/WORKPLACE/DS and CP/Competitive Programming/VSCODE/IO/input.txt"));
                  out = new PrintWriter("/media/ankanchanda/Data/WORKPLACE/DS and CP/Competitive Programming/VSCODE/IO/output.txt");
              } else {
                  br = new BufferedReader(new InputStreamReader(System.in));
                  out = new PrintWriter(System.out);
              }
          } catch (FileNotFoundException e) {
              System.out.println(e);
          }
          solve();
          out.flush();
      }
  }