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.math.*;
  import java.util.*;
  
  // @author : Dinosparton 
  
  public class test {
  	 
  	   static class Pair{ 
  		   long x;
  		   long y;
  		   
  		   Pair(long x,long y){ 
  			   this.x = x;
  			   this.y = y;
  			   
  		   }
  	   }
  	   static class Duo{
  		   int x;
  		   String s;
  		   
  		   Duo(int x,String s){
  			   this.x = x;
  			   this.s = s;
  		   }
  	   }
  	 
  	   static class Sort implements Comparator<Pair>
  	   {
  
  	       @Override
  	       public int compare(Pair a, Pair b)
  	       {
  	           if(a.x!=b.x)
  	           {
  	               return (int)(a.x - b.x);
  	           }
  	           else
  	           {
  	               return (int)(a.y-b.y);
  	           }
  	       }
  	   }
  	   
  	   static class Compare { 
  		   
  		     void compare(Pair arr[], int n) 
  		    { 
  		        // Comparator to sort the pair according to second element 
  		        Arrays.sort(arr, new Comparator<Pair>() { 
  		            @Override public int compare(Pair p1, Pair p2) 
  		            { 
  		            	if(p1.x!=p2.x) {
  		                return (int)(p1.x - p2.x); 
  		            	}
  		            	else { 
  		            		return (int)(p1.y - p2.y);
  		            	}
  		            } 
  		        }); 
  		  
  //		        for (int i = 0; i < n; i++) { 
  //		            System.out.print(arr[i].x + " " + arr[i].y + " "); 
  //		        } 
  //		        System.out.println(); 
  		    } 
  		} 
  	 
  	   static class Scanner {
  	        BufferedReader br;
  	        StringTokenizer st;
  	 
  	        public Scanner()
  	        {
  	            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 recursion(boolean visited[],ArrayList<Integer> list) {
  		 
  		 if(list.size() == visited.length) {
  			 int peak = 0;
  			 int valley = 0;
  			 
  			 for(int i=1;i<visited.length-1;i++) {
  				 if(list.get(i)>list.get(i-1) && list.get(i)>list.get(i+1)) {
  					 peak++;
  				 }
  				 if(list.get(i)<list.get(i-1) && list.get(i)<list.get(i+1)) {
  					 valley++;
  				 }
  				 
  				 System.out.print(list.get(i)+" "); 
  			 }
  			 System.out.print(list.get(visited.length-1)+"  |  ");
  			 System.out.println(peak+" "+valley);
  		 }
  		 
  		 for(int i=0;i<visited.length;i++) {
  			 if(!visited[i]) {
  				 visited[i] = true;
  				 list.add(i);
  				 recursion(visited,list);
  				 list.remove(list.size()-1);
  				 visited[i] = false;
  			 }
  		 }
  	 }
  	   public static void main(String args[]) throws Exception { 
  		
  		   Scanner sc = new Scanner();
  		   StringBuilder res = new StringBuilder();
  		
  		   int tc = sc.nextInt();
  		  
  		   while(tc-->0) { 
  			  
  			  int n = sc.nextInt();
  			  int a = sc.nextInt();
  			  int b = sc.nextInt();
  			 
  			  int arr[] = new int[n];
  			  
  		        for (int i = 1; i <= n; i++) {
  		        	arr[i-1] = i;
  		        }
  
  		        int x = a + b;
  		        if (x > n - 2 || Math.abs(a - b) > 1) {
  		            res.append(-1+"\n");
  		            continue;
  		        }
  
  		        boolean flag = false;
  		        if (a > b) {
  		        	int temp = arr[n-1];
  		        	arr[n-1] = arr[n-2];
  		        	arr[n-2] = temp;
  		            
  		            a--;
  		        }
  		        if (a < b) {
  		        	int temp = arr[0];
  		        	arr[0] = arr[1];
  		        	arr[1] = temp;
  		            b--;
  		            flag = true;
  		        }
  
  		        int index = 1;
  		        if(flag) {
  		        	index++;
  		        }
  		        for (int i = 0; i < a; i++) {
  		        	int temp = arr[index];
  		        	arr[index] = arr[index+1];
  		        	arr[index+1] = temp;
  		            
  		            index += 2;
  		        }
  
  		        for (int i : arr) {
  		        	res.append(i+" ");
  		        }
  		        res.append("\n");
  		   }
  		   System.out.println(res);
  	   }
  }  
  
  
  
  
  