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 q2 {
      public static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  //    public static long mod = 1000000007;
  
      public static void solve() throws Exception {
          String[] parts = br.readLine().split(" ");
          int n = Integer.parseInt(parts[0]);
          int a = Integer.parseInt(parts[1]);
          int b = Integer.parseInt(parts[2]);
  
          int val = (n - 1) / 2;
  
          if (a > val || b > val || a + b > n - 2 || Math.abs(a - b) > 1) {
              System.out.println(-1);
              return;
          }
  
          if (a == 0 && b == 0) {
              StringBuilder ans = new StringBuilder();
              for (int i = 1; i <= n; i++) ans.append(i).append(' ');
              System.out.println(ans);
              return;
          }
          if (n == 2) {
              System.out.println(-1);
              return;
          }
  
          StringBuilder ans = new StringBuilder();
          if (a > b) {
              int sm = n - (2 * a + 1);
              ans.append(sm + 1).append(' ').append(sm + 3).append(' ').append(sm + 2).append(' ');
              int tn = sm + 4;
              for (int i = 1; i < a; i++) {
                  ans.append(tn + 1).append(' ').append(tn).append(' ');
                  tn += 2;
              }
              while (sm != 0) ans.append(sm--).append(' ');
          } else if (a == b) {
              ans.append(n).append(' ').append(n - 2).append(' ').append(n - 1).append(' ');
              n -= 3;
              for (int i = 1; i < b; i++) {
                  ans.append(n - 1).append(' ').append(n).append(' ');
                  n -= 2;
              }
              while (n > 0) ans.append(n--).append(' ');
          } else {
              int on = n + 1;
              n = 2 * b + 1;
              int tn = n + 1;
              ans.append(n).append(' ').append(n - 2).append(' ').append(n - 1).append(' ');
              n -= 3;
              for (int i = 1; i < b; i++) {
                  ans.append(n - 1).append(' ').append(n).append(' ');
                  n -= 2;
              }
              while (tn != on) ans.append(tn++).append(' ');
          }
  
          System.out.println(ans);
      }
  
      public static void main(String[] args) throws Exception {
          int tests = Integer.parseInt(br.readLine());
          for (int test = 1; test <= tests; test++) {
              solve();
          }
      }
  
  //    public static void sort(int[] arr){
  //        ArrayList<Integer> temp = new ArrayList<>();
  //        for(int val : arr) temp.add(val);
  //
  //        Collections.sort(temp);
  //
  //        for(int i = 0;i < arr.length;i++) arr[i] = temp.get(i);
  //    }
  //    public static void sort(long[] arr){
  //        ArrayList<Long> temp = new ArrayList<>();
  //        for(long val : arr) temp.add(val);
  //
  //        Collections.sort(temp);
  //
  //        for(int i = 0;i < arr.length;i++) arr[i] = temp.get(i);
  //    }
  //
  //    public static long power(long a,long b,long mod){
  //        if(b == 0) return 1;
  //
  //        long p = power(a,b / 2,mod);
  //        p = (p * p) % mod;
  //
  //        if(b % 2 == 1) return (p * a) % mod;
  //        return p;
  //    }
  //
  //    public static int GCD(int a,int b){
  //        return b == 0 ? a : GCD(b,a % b);
  //    }
  //    public static long GCD(long a,long b){
  //        return b == 0 ? a : GCD(b,a % b);
  //    }
  //
  //    public static int LCM(int a,int b){
  //        return a * b / GCD(a,b);
  //    }
  //    public static long LCM(long a,long b){
  //        return a * b / GCD(a,b);
  //    }
  }
  