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.lang.*;
  import java.io.*;
  public class Main
  {
  	public static void main (String[] args) throws java.lang.Exception
  	{
  	    Scanner sc=new Scanner(System.in);
  	   // BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
  	    int t=1;
  	    t=sc.nextInt();
  	    PrintWriter out=new PrintWriter(System.out);
  	    //int t=Integer.parseInt(br.readLine());
  	    while(--t>=0){
  	        int n=sc.nextInt();
  	        int a=sc.nextInt();
  	        int b=sc.nextInt();
  	        if(Math.abs(a-b)>1||(a+b)>(n-2)){
  	          out.println(-1);
  	        }
  	        else{
  	          if(a>b){
  	            int x=n-a*2;
  	            for(int i=1;i<=x;i++){
  	              out.print(i+" ");
  	            }
  	            int y=x+2;
  	            for(int i=x+1;i<=n;i=i+2){
  	              out.print((i+1)+" "+(i)+" ");
  	            }
  	            out.println();
  	          }
  	          else if(b>a){
  	           int x=n-b*2;
  	            for(int i=1;i<=x;i++){
  	              out.print((n-i+1)+" ");
  	            }
  	            int y=x+2;
  	            for(int i=x+1;i<=n;i=i+2){
  	              out.print((n-i)+" "+(n-i+1)+" ");
  	            }
  	            out.println();
  	          }
  	          else{
  	            out.print(1+" ");
  	            for(int i=2;i<=a*2;i=i+2){
  	              out.print((i+1)+" "+i+" ");
  	            }
  	            for(int i=a*2+2;i<=n;i++){
  	              out.print(i+" ");
  	            }
  	            out.println();
  	            
  	          }
  	          
  	          
  	          
  	          
  	        }
  	     
  	        
  	    }
  	    out.close();
  	}
  }