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.math.BigInteger;
  import java.util.*;
  import static java.lang.Math.PI;
  import static java.lang.System.in;
  import static java.lang.System.out;
  import static java.lang.System.err;
  
  public class B {    
  
      static int what(ArrayList<Integer> arr, int min, int max) {
          int mina = 0, maxa = 0;
          for(int i = 1; i < arr.size()-1; i++) {
              int prev = arr.get(i-1);
              int cur = arr.get(i);
              int next = arr.get(i+1);
              if(prev > cur && cur < next)    mina++;
              if(prev < cur && cur > next)    maxa++;
          }
          // out.println(arr);
          // out.println(maxa + " " + mina);
          if(mina==min && maxa==max)  return 1;
          return 0;
      }
      public static void main(String[] args) throws Exception {   
          Foster sc = new Foster();
          PrintWriter p = new PrintWriter(out);
  
         /*
          * Is that extra condition needed
          * Check overflow in pow function or in general
          * Check indices of read array functions
          * Think of an easier solution because the problems you solve are always easy
          * Check the iterator of loop
          */   
  
          int t = sc.nextInt();
          while(t--!=0) {
              int n = sc.nextInt(), b = sc.nextInt(), a = sc.nextInt();
              int min = a, max = b;
              // if(a+b+2 > n) {
              //     p.println("-1");
              //     continue;
              // }
              // if(Math.abs(a-b) > 1) {
              //     p.println("-1");
              //     continue;
              // }
              // if(a==b && n%2!=0) {
              //     p.println("-1");
              //     continue;
              // }
              if(a==0 && b==0) {
                  for(int i = 1; i <= n; i++) {
                      p.print(i + " ");
                  }
                  p.println();
                  continue;
              }
              ArrayList<Integer> arr = new ArrayList<>();
              int L = 1, H = n;
              if(a==b) {
                  arr.add(L);
                  L++;
                  while(b > 0) {
                      // p.print(H + " ");
                      arr.add(H);
                      H--;
                      b--;
                      if(a > 0) {
                          // p.print(L + " ");
                          arr.add(L);
                          L++;
                          a--;
                      }
                  }
                  while(H >= L) {
                      // p.print(H + " ");
                      arr.add(L);
                      L++;
                  }
  
              }
              else if(a > b) {
                  // p.print(H + " ");
                  arr.add(H);
                  H--;
                  while(a > 0) {
                      // p.print(L + " ");
                      arr.add(L);
                      L++;
                      a--;
                      if(b > 0) {
                          // p.print(H + " ");
                          arr.add(H);
                          H--;
                          b--;
                      }
                  }
                  while(L <= H) {
                      // p.print(L + " ");
                      arr.add(L);
                      L++;
                  }
              } else {
                  // p.print(L + " ");
                  arr.add(L);
                  L++;
                  while(b > 0) {
                      // p.print(H + " ");
                      arr.add(H);
                      H--;
                      b--;
                      if(a > 0) {
                          // p.print(L + " ");
                          arr.add(L);
                          L++;
                          a--;
                      }
                  }
                  while(H >= L) {
                      // p.print(H + " ");
                      arr.add(H);
                      H--;
                  }
              }
              if(what(arr, min, max)==1) {
                  for(int i : arr) {
                      p.print(i + " ");
                  }
                  p.println();
              } else {
                  p.println("-1");
              }
          }
          p.close();
      }
      
      static long[] sort(long a[]) {
          ArrayList<Long> arr = new ArrayList<>();
          for(long i : a) {
              arr.add(i);
          }
          Collections.sort(arr);
          for(int i = 0; i < arr.size(); i++) {
              a[i] = arr.get(i);
          }
          return a;
      }
      static int[] sort(int a[]) {
          ArrayList<Integer> arr = new ArrayList<>();
          for(int i : a){
              arr.add(i);
          }
          Collections.sort(arr);
          // Collections.reverse(arr);
          for(int i = 0; i < arr.size(); i++){
              a[i] = arr.get(i);
          }
          return a;
      }   
  
      static class Foster {
          BufferedReader br = new BufferedReader(new InputStreamReader(in));
          StringTokenizer st = new StringTokenizer("");
          String next() {
              while (!st.hasMoreTokens())
                  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());
          }
          int[] intArray(int n) {
              int arr[] = new int[n];
              for(int i = 0; i < n; i++) {
                  arr[i] = nextInt();
              }
              return arr;
          }
          long[] longArray(int n) {
              long arr[] = new long[n];
              for(int i = 0; i < n; i++) {
                  arr[i] = nextLong();
              }
              return arr;
          }
          static long pow(long... a) {
              long mod = Long.MAX_VALUE;
              if(a.length == 3)   mod = a[2];
              long res = 1;
              while(a[1] > 0) {
                  if((a[1] & 1) == 1)
                      res = (res * a[0]) % mod;
                  a[1] /= 2;
                  a[0] = (a[0] * a[0]) % mod;
              }
              return res;
          }
          static long gcd(long a, long b) {
              if (b == 0)
                  return a;
              return gcd(b, a % b);
          }
      }
  }