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.util.*;
  
      public class Main {
  
          public static void main(String[] args) {
              /*Scanner in = new Scanner(System.in);
              HashMap<Integer, Integer> map = new HashMap<>();
              var n = in.nextInt();
              for (int i = 0; i < n; i++) {
                  var a = in.nextInt();
                  if(map.containsKey(a))
                      map.put(a,map.get(a)+1);
                  else
                      map.put(a,1);
              }
              for (Map.Entry<Integer,Integer> item: map.entrySet()) {
                  System.out.println(item.getKey() + " " + item.getValue());
  
              }*/
              Scanner in = new Scanner(System.in);
              int t = in.nextInt();
              for (int i = 0; i < t; i++) {
                  int n = in.nextInt(),a=in.nextInt(),b=in.nextInt();
  
                  if(Math.abs(a-b) > 1 || n - (Math.min(a,b)*2 + 2) - (Math.max(a,b) - Math.min(a,b)) < 0)
                      System.out.print(-1);
                  else {
                      if(n == 2){
                          System.out.println("1 2");
                          continue;
                      }
                      if(a == b){
                          int chet = a+b, index = 1;
                          System.out.print(1 + " ");
                          for (int j = 2; j <= n -1; j++) {
                              if(chet == 0)
                                  break;
  
                              if(j%2 == 0)
                                  System.out.print(j+1 + " ");
                              else
                                  System.out.print(j-1 + " ");
                              chet--;
                              index = j;
  
                          }
                          for (int j = index + 1; j <= n ; j++) {
                              System.out.print(j + " ");
                          }
  
                      }
                      else {
                          if(a > b){
                              int chet = a+b -1, index = 1;
                              System.out.print(1 + " ");
                              for (int j = 2; j <= n - 1; j++) {
                                  if(chet == 0)
                                      break;
  
                                  if(j%2 ==0)
                                      System.out.print(j+1 + " ");
                                  else
                                      System.out.print(j-1 + " ");
                                  chet--;
                                  index = j;
                              }
                              for (int j = index + 1; j <= n-2 ; j++)
                                  System.out.print(j + " ");
  
                              System.out.print(n + " " + (n-1));
                          }
                          else{
                              int chet = a  + b - 1, index = 2;
                              System.out.print(2 + " " + 1 + " " );
                              for (int j = 3; j <= n - 1; j++) {
                                  if(chet == 0)
                                      break;
  
                                  if(j % 2 == 1)
                                      System.out.print(j+1 + " ");
                                  else
                                      System.out.print(j-1 + " ");
                                  chet--;
                                  index = j;
  
                              }
                              for (int j = index + 1; j <= n ; j++)
                                  System.out.print(j + " ");
  
                          }
                      }
                  }
                  System.out.println();
              }
          }
      }
  
  