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.io.PrintWriter;
  import java.util.StringTokenizer;
  
  public class B {
      static class RealScanner {
          BufferedReader br = new BufferedReader(new InputStreamReader(System.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());
          }
  
          int[] readArray(int n) {
              int[] a = new int[n];
              for (int i = 0; i < n; i++) a[i] = nextInt();
              return a;
          }
  
          long nextLong() {
              return Long.parseLong(next());
          }
      }
  
      public static void main(String[] args) {
          PrintWriter out = new PrintWriter(System.out);
          RealScanner sc = new RealScanner();
          int t = sc.nextInt();
          while (t-- > 0) {
              int n = sc.nextInt();
              int a, b;
              a = sc.nextInt();
              b = sc.nextInt();
              if (Math.abs(a - b) > 1) {
                  out.println(-1);
                  continue;
              }
              if (a + b + 2 > n) {
                  out.println(-1);
                  continue;
              }
              int val = a - b, min_val = 0, max_val = 0;
  
  
              if (val == 0) {//1
                  min_val = 1;
                  max_val = n - 1;
                  out.print(n + " ");
                  while (a-- > 0) {
                      out.print(min_val + " " + max_val + " ");
                      min_val++;
                      max_val--;
                  }
                  for (int i = max_val; i >= min_val; i--) {
                      out.print(" " + i);
                  }
                  out.println();
              }
  
  
              if (val == 1) {//2
                  min_val = 1;
                  max_val = n;
                  while (a-- > 0) {
                      out.print(min_val + " " + max_val + " ");
                      min_val++;
                      max_val--;
                  }
                  for (int i = max_val; i >= min_val; i--) {
                      out.print(" " + i);
                  }
                  out.println();
              }
  
  
              if (val == -1) {//3
                  min_val = 1;
                  max_val = n;
                  while (b-- > 0) {
                      out.print(max_val + " " + min_val + " ");
                      min_val++;
                      max_val--;
                  }
                  for (int i = min_val; i <= max_val; i++) {
                      out.print(" " + i);
                  }
                  out.println();
              }
          }
          out.flush();
          out.close();
      }
  }
  