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: /*
    Challenge 1: Newbie to CM in 1year (Dec 2021 - Nov 2022)   🔥 5* Codechef
    Challenge 2: CM to IM in 1 year (Dec 2022 - Nov 2023)    🔥🔥 6* Codechef
    Challenge 3: IM to GM in 1 year (Dec 2023 - Nov 2024)  🔥🔥🔥 7* Codechef
    Goal: Become better in CP!
    Key: Consistency!
  */
  
  // New Concept: Derangements => D(n)=(n-1)*[D(n-1)+D(n-2)]
  import java.util.*;
  import java.io.*;
  import java.math.*;
  
  public class Coder {
  
    static StringBuffer str=new StringBuffer();
    static int n, a, b;
  
    static void solve(){
  
      if(Math.abs(a-b)>1){
        str.append("-1\n");
        return;
      }
      if(n%2==1){
        if((a>=n/2 && b>=n/2) || a>n/2 || b>n/2){
          str.append("-1\n");
          return;
        }
      }else{
        if(a>=n/2 || b>=n/2 || a>n/2 || b>n/2){
          str.append("-1\n");
          return;
        }
      }
      // if((n%2==1 && a==n/2 && b==n/2) || a>n/2 || b>n/2 || Math.abs(a-b) > 1){
      //   str.append("-1\n");
      //   return;
      // }
  
      if(a==b){
        int l=1, r=n;
        for(int i=0;i<a;i++){
          str.append(l++).append(" ").append(r--).append(" ");
        }
        for(int i=l;i<=r;i++) str.append(i).append(" ");
        str.append("\n");
      }
      if(a<b){
        int l=1, r=n;
        for(int i=0;i<b;i++){
          str.append(r--).append(" ").append(l++).append(" ");
        }
        for(int i=l;i<=r;i++) str.append(i).append(" ");
        str.append("\n");
      }
      if(a>b){
        int l=1, r=n;
        for(int i=0;i<a;i++){
          str.append(l++).append(" ").append(r--).append(" ");
        }
        for(int i=r;i>=l;i--) str.append(i).append(" ");
        str.append("\n");
      }
    }
  
    public static void main(String[] args) throws java.lang.Exception {
      BufferedReader bf;
      PrintWriter pw;
      boolean lenv=false;
      if(lenv){
        bf = new BufferedReader(
                            new FileReader("input.txt"));
        pw=new PrintWriter(new
              BufferedWriter(new FileWriter("output.txt")));
      }else{
        bf = new BufferedReader(new InputStreamReader(System.in));
        pw = new PrintWriter(new OutputStreamWriter(System.out));
      }
      
      int t = Integer.parseInt(bf.readLine().trim());
      while (t-- > 0) {
        String []st=bf.readLine().trim().split("\\s+");
        n=Integer.parseInt(st[0]);
        a=Integer.parseInt(st[1]);
        b=Integer.parseInt(st[2]);
        solve();
      }
      pw.print(str);
      pw.flush();
      // System.outin.print(str);
    }
  }