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.*;
  
  public class Main {
  
      public static void main(String[] args) throws IOException {
          int n, counter, a,b, m, sum, p1, p2, t, k;
  
  
  
  
  
          BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
          PrintWriter writerObj = new PrintWriter(System.out);
  
          StringTokenizer st = new StringTokenizer(br.readLine(), " ");
          t = Integer.parseInt(st.nextToken());
  
  
          for (int i = 0; i < t; i++) {
              st = new StringTokenizer(br.readLine(), " ");
  
              n = Integer.parseInt(st.nextToken());
              a = Integer.parseInt(st.nextToken());
              b = Integer.parseInt(st.nextToken());
  
              int[] numbers = new int[n];
              for (int j = 0; j < n; j++) {
                  numbers[j] = j + 1;
              }
  
              if (Math.abs(a - b) > 1 ||
                  a + b > n - 2
              ) {
                  System.out.println(-1);
                  continue;
              }
  
              if (a == 0 && b == 0) {
  
              }
  
              else if (a < b) {
                  for (int j = 0; j < b; j++) {
                      numbers[1 + j * 2] = j + 1;
                  }
  
                  int max = n - a;
  
                  for (int j = 0; j < a; j++) {
                      numbers[2 + j * 2 ] = max + 1;
                      max++;
                  }
  
                  numbers[0] = n - a;
  
                  for (int j = b; j < n - a; j++) {
                      numbers[a + j] = j;
                  }
  
  
              } else if (a == b) {
                  for (int j = 0; j < b - 1; j++) {
                      numbers[2 + j * 2] = j + 1;
                  }
  
                  int max = n - a + 1;
  
                  for (int j = 0; j < a; j++) {
                      numbers[1 + j * 2] = max;
                      max++;
                  }
  
                  numbers[0] = n - a;
  
                  int lim = b;
  
                  for (int j = a + b; j < n; j++) {
                      numbers[j] = lim++;
                  }
  
              }
  
              else {
                  for (int j = 0; j < b; j++) {
                      numbers[2 + j * 2] = j + 1;
                  }
  
                  int max = n - a + 1;
  
                  for (int j = 0; j < a; j++) {
                      numbers[1 + j * 2] = max;
                      max++;
                  }
  
                  numbers[0] = n - a;
  
                  int lim = n - a - 1;
  
                  for (int j = a + b + 1; j < n; j++) {
                      numbers[j] = lim--;
                  }
  
              }
  
  
              for (int j = 0; j < n; j++) {
                  System.out.print(numbers[j] + " ");
              }
  
  
              System.out.println();
  
          }
  
  
          writerObj.flush();
          writerObj.close();
      }
  }
  