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.ArrayList;
  import java.util.StringTokenizer;
  
  public class Main {
  
      BufferedReader in;
      PrintWriter out;
  
      Main() {
          in = new BufferedReader(new InputStreamReader(System.in));
          out = new PrintWriter(System.out);
      }
  
      void close() throws IOException {
          in.close();
          out.flush();
          out.close();
      }
  
      void solve() throws IOException {
          int t = Integer.parseInt(in.readLine());
          while (t > 0) {
              StringTokenizer st = new StringTokenizer(in.readLine());
              int n = Integer.parseInt(st.nextToken());
              int a = Integer.parseInt(st.nextToken());
              int b = Integer.parseInt(st.nextToken());
  
              int sum = n - 2;
              int h;
              if (n % 2 == 1) {
                  h = sum / 2 + 1;
              } else {
                  h = sum / 2;
              }
              if (a + b <= sum && a <= h && b <= h && Math.abs(a - b) <= 1) {
                  int c = 0;
                  int d = n - 1;
                  ArrayList<Integer> res = new ArrayList<>();
                  if (a >= b) {
                      res.add(0);
                      c++;
                      while (a > 0 || b > 0) {
                          if (a > 0) {
                              res.add(d);
                              a--;
                              d--;
                          }
                          if (b > 0) {
                              res.add(c);
                              b--;
                              c++;
                          }
                      }
                  } else {
                      res.add(n - 1);
                      d--;
                      while (a > 0 || b > 0) {
                          if (b > 0) {
                              res.add(c);
                              b--;
                              c++;
                          }
                          if (a > 0) {
                              res.add(d);
                              a--;
                              d--;
                          }
                      }
                  }
                  if (res.get(res.size() - 1) == c - 1) {
                      for (int j = c; j <= d; j++) {
                          res.add(j);
                      }
                  } else {
                      for (int j = d; j >= c; j--) {
                          res.add(j);
                      }
                  }
                  for (int i = 0; i < n; i++) {
                      if (i != 0) {
                          out.append(' ');
                      }
                      out.append(String.format("%d", res.get(i) + 1));
                  }
                  out.append('\n');
              } else {
                  out.append("-1\n");
              }
              t--;
          }
      }
  
      public static void main(String[] args) throws IOException {
          Main m = new Main();
          m.solve();
          m.close();
      }
  
  }