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.*;
  import java.io.*;
  
  //           THIS TEMPLATE MADE BY AKSH BANSAL.
  
  public class Solution {
      static class FastReader {
          BufferedReader br;
          StringTokenizer st;
          public FastReader() {
              br = new BufferedReader(new InputStreamReader(System.in));
          }
          String next() {
              while (st == null || !st.hasMoreElements()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
          int nextInt() {
              return Integer.parseInt(next());
          }
          long nextLong() {
              return Long.parseLong(next());
          }
          double nextDouble() {
              return Double.parseDouble(next());
          }
          String nextLine() {
              String str = "";
              try {
                  str = br.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
      }
      static void sort(int a[]){ // int -> long
          ArrayList<Integer> arr=new ArrayList<>(); // Integer -> Long
          for(int i=0;i<a.length;i++)
          arr.add(a[i]);
          Collections.sort(arr);
          for(int i=0;i<a.length;i++)
          a[i]=arr.get(i);
          
      }
      private static long gcd(long a, long b){
          if(b==0)return a;
          return gcd(b,a%b);
      }
      private static long pow(long x,long y){
          if(y==0)return 1;
          long temp = pow(x, y/2);
          if(y%2==1){
              return x*temp*temp;
          }
          else{
              return temp*temp;
          }
      }
      static int log(long n){
          int res = 0;
          while(n>0){
              res++;
              n/=2;
          }
          return res;
      }
  
      static int mod = (int)1e9+7;
      static PrintWriter out;
      static FastReader sc ;
      public static void main(String[] args) throws IOException {
          sc = new FastReader();
          out = new PrintWriter(System.out);
          // primes();
          // ________________________________
  
          int test = sc.nextInt();
          StringBuilder output = new StringBuilder();
  
          while (test-- > 0) {
              int n =sc.nextInt();
              int a =sc.nextInt();
              int b =sc.nextInt();
              solver(n, a, b);
          }
  
          out.print(output);
          // _______________________________
  
          // int n = sc.nextInt();
          // out.println(solver());
          // ________________________________
          out.flush();
      }
  
      public static void solver(int n, int a, int b) {
          if(Math.abs(a-b)>1 || a>n/2 || b>n/2 || a+b>n-2){
              out.println(-1);
              return;
          }
          int aa = a;
          int bb = b;
          int[] res=  new int[n];
  
          if(a==b){
              for(int i=0;i<n;i++)res[i] = i+1;
              for(int i=1;i<n-1;i+=2){
                  if(a==0)break;
                  int temp = res[i];
                  res[i] = res[i+1];
                  res[i+1] = temp;
                  a--;
                  b--;
              }
          }
          else if(a>b){
              for(int i=0;i<n;i++)res[i] = i+1;
              int pos = 0;
              for(int i=1;i<n-1;i+=2){
                  if(a==0)break;
                  int temp = res[i];
                  res[i] = res[i+1];
                  res[i+1] = temp;
                  a--;
                  b--;
                  pos+=2;
              }
              for(int i=0;i<(n-pos)/2;i++){
                  int temp = res[pos+i];
                  res[pos+i] = res[n-i-1];
                  res[n-i-1] = temp;
              }
          }
          else{
              for(int i=n-1;i>=0;i--)res[i] = n-i;
              int pos = 0;
              for(int i=1;i<n-1;i+=2){
                  if(b==0)break;
                  int temp = res[i];
                  res[i] = res[i+1];
                  res[i+1] = temp;
                  a--;
                  b--;
                  pos+=2;
              }
              for(int i=0;i<(n-pos)/2;i++){
                  int temp = res[pos+i];
                  res[pos+i] = res[n-i-1];
                  res[n-i-1] = temp;
              }
          }
          // if(!check(aa,bb,res)){
          //     out.println("Wrong!");
          // }
          for(int i:res)
              out.print(i+" ");
          out.println();
      }
      static boolean check(int a, int b, int[] res){
          int high = 0, low = 0;
          int n = res.length;
          for(int i=1;i<n-1;i++){
              if(res[i]>res[i-1] && res[i]>res[i+1])high++;
              if(res[i]<res[i-1] && res[i]<res[i+1])low++;
          }
          return a==high && b==low;
      }
  }
  