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.StringTokenizer;
  
  public class BuildThePermutation {
      private 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 void main(String[] args) {
          FastReader scanner = new FastReader();
          int tests = scanner.nextInt();
          while (tests-- > 0) {
              int numbers = scanner.nextInt();
              int highs = scanner.nextInt();
              int lows = scanner.nextInt();
              if(highs+lows+2 > numbers || Math.abs(highs-lows) > 1) {
                  System.out.println(-1);
                  continue;
              }
              int l = 1;
              int r = numbers;
              boolean goUp = true;
              if(highs < lows) {
                  goUp = false;
                  System.out.print(numbers + " ");
                  r--;
              } else {
                  System.out.print(1 + " ");
                  l++;
              }
  
              for (int i = 1; i < numbers; i++) {
                  if(highs <= 0 && lows <= 0) {
                      if(!goUp) {
                          System.out.print(r + " ");
                          r--;
                      } else {
                          System.out.print(l + " ");
                          l++;
                      }
                      continue;
                  }
                  if(goUp) {
                      System.out.print(r + " ");
                      highs--;
                      r--;
                      goUp = false;
                  } else {
                      System.out.print(l + " ");
                      lows--;
                      l++;
                      goUp = true;
                  }
              }
              System.out.println();
          }
      }
  }
  