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 {
      static BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
      static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
      static int mod = (int)1e9+7;
      static boolean[] isprime=new boolean[1];
      static {
          for(int i=2;i<isprime.length;i++) isprime[i]=true;
          for(int i=2;i<isprime.length;i++) {
              if(isprime[i]) {
                  for(int k = 2; i*k<isprime.length; k++) {
                      isprime[i*k] = false;
                  }
              }
          }
      }
      public static void main(String[] args) throws Exception {
          String ss = bf.readLine();
          if (ss.contains(" ")) ss = ss.substring(0, ss.indexOf(" "));
          int t = Integer.parseInt(ss);
          while (t-- > 0) {
              String s[] = bf.readLine().split(" ");
              int n = Integer.parseInt(s[0]);
              int a = Integer.parseInt(s[1]);
              int b = Integer.parseInt(s[2]);
              int c[] = new int[n];
              boolean vis[] = new boolean[n+1];
              int tmp[] =new int[n];
              for(int i = 0;i < n;i++) tmp[i] = i+1;
              if(a+b > n-2 || a > (n-1)/2 || b > (n-1)/2 || Math.abs(a-b) > 1){
                  bw.write(-1 + "\n");
              }else{
                  if(a == b && a == 0){
                      c = tmp.clone();
                  }
                  else if(a == b){
                      int x = 1, y = n / 2 + 1;
                      vis[x] = true;
                      c[0] = x++;
                      for (int i = 1; i < n; i++) {
                          if ((i & 1) == 0) {
                              vis[x] = true;
                              c[i] = x++;
                          } else {
                              if (a == 1) {
                                  vis[y] = true;
                                  c[i++] = y++;
                                  int j = i, k = 1;
                                  for(;k <= n && j < n;k++){
                                      if(!vis[k]){
                                          c[j++] = k;
                                      }
                                  }
                                  break;
                              }
                              vis[y] = true;
                              c[i] = y++;
                              a--;
                          }
                      }
                  }else if(a > b){
                      int x = 1, y = n / 2 + 1;
                      vis[x] = true;
                      c[0] = x++;
                      for (int i = 1; i < n; i++) {
                          if ((i & 1) == 0) {
                              vis[x] = true;
                              c[i] = x++;
                          } else {
                              if (a == 1) {
                                  int j = i, k = n;
                                  for(;k > 0 && j < n;k--){
                                      if(!vis[k]){
                                          c[j++] = k;
                                      }
                                  }
                                  break;
                              }
                              vis[y] = true;
                              c[i] = y++;
                              a--;
                          }
                      }
                  }else{
                      int x = 1, y = (n+1)/2+1;
                      vis[y] = true;
                      c[0] = y++;
                      for (int i = 1; i < n; i++) {
                          if ((i & 1) == 1) {
                              if (b == 1) {
                                  int j = i, k = 1;
                                  for(;k <= n && j < n;k++){
                                      if(!vis[k]){
                                          c[j++] = k;
                                      }
                                  }
                                  break;
                              }
                              vis[x] = true;
                              c[i] = x++;
                              b--;
                          } else {
                              vis[y] = true;
                              c[i] = y++;
                          }
                      }
                  }
                  for(int i = 0;i < n;i++){
                      bw.write(c[i] +" ");
                  }
                  bw.write("\n");
              }
          }
          bw.flush();
      }
  
      public static long gcd(long a, long b){
          return b == 0 ? a : gcd(b,a%b);
      }
  
      public static long lcm(long a, long b){
          return a*b / gcd(a,b);
      }
  }