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.util.*;
  
  public class Main {
  
      public static void main(String[] args) throws
              IOException {
          int t = nextInt();
          while (t-- != 0) {
              int n = nextInt();
              int a = nextInt();
              int b = nextInt();
              int[] ans = new int[n];
              if (Math.abs(a - b) >= 2 || a + b > n - 2) out.println(-1);
              else {
                  int x = n;
                  int y = 1;
                  if (a > b) {
                      for (int i = 0; i < Math.min(a * 2, n); i++) {
                          if (i % 2 == 1) {
                              ans[i] = x;
                              x--;
                          } else {
                              ans[i] = y;
                              y++;
                          }
                      }
                      for (int i = a * 2; i < n; i++) {
                          ans[i] = x;
                          x--;
                      }
                  } else if (a < b) {
                      for (int i = 0; i < Math.min(b * 2, n); i++) {
                          if (i % 2 == 1) {
                              ans[i] = y;
                              y++;
                          } else {
                              ans[i] = x;
                              x--;
                          }
                      }
                      for (int i = b * 2; i < n; i++) {
                          ans[i] = y;
                          y++;
                      }
                  } else {
                      for (int i = 0; i < Math.min(b * 2 + 1, n); i++) {
                          if (i % 2 == 0) {
                              ans[i] = y;
                              y++;
                          } else {
                              ans[i] = x;
                              x--;
                          }
                      }
                      for (int i = a * 2 + 1; i < n; i++) {
                          ans[i] = y;
                          y++;
                      }
                  }
                  int cnt1 = 0;
                  int cnt2 = 0;
                  for (int i = 1; i < n-1; i++) {
                      if(ans[i-1]<ans[i]&&ans[i]>ans[i+1])cnt1++;
                      else if(ans[i-1]>ans[i]&&ans[i]<ans[i+1])cnt2++;
                  }
                  if(cnt1==a&&cnt2==b){
                      for (int i = 0; i < n; i++) {
                          out.print(ans[i]+" ");
                      }
                      out.println();
                  }
                  else out.println(-1);
              }
          }
          out.close();
      }
  
      static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
      static PrintWriter out = new PrintWriter(System.out);
      static StringTokenizer in = new StringTokenizer("");
  
  
      public static boolean hasNext() throws IOException {
          if (in.hasMoreTokens()) return true;
          String s;
          while ((s = br.readLine()) != null) {
              in = new StringTokenizer(s);
              if (in.hasMoreTokens()) return true;
          }
          return false;
      }
  
      public static String nextToken() throws IOException {
          while (!in.hasMoreTokens()) {
              in = new StringTokenizer(br.readLine());
          }
          return in.nextToken();
      }
  
      public static int nextInt() throws IOException {
          return Integer.parseInt(nextToken());
      }
  
      public static double nextDouble() throws IOException {
          return Double.parseDouble(nextToken());
      }
  
      public static long nextLong() throws IOException {
          return Long.parseLong(nextToken());
      }
  }