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.*;
  public class Main {
  		static long mod = 1000000007;
  		static long max ;
  		static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
  		public static void main(String[] args) throws IOException  {
  			FastReader sc = new FastReader();
  			int t = sc.nextInt();
  			while( t-- > 0) {
  				int n = sc.nextInt();
  				int a = sc.nextInt();
  				int b = sc.nextInt();
  				boolean check = false;
  				if( a >= b) {
  					int x =a;
  					int y =b;
  					if( x== 0 && y == 0 && n>2) {
  						check = false;
  					}
  					ArrayDeque<Integer> arr = new ArrayDeque<>();
  					int i = 1;
  					int j = n;
  					int count = 2;
  					arr.add(i);
  					arr.add(j);
  					j--;
  					i++;
  					while( j>=i && (b!= 0 || a!= 0)) {
  //						out.println(arr + " " + a + " " + b);
  						if( count %2 != 0){
  							arr.add(j);
  							b--;
  							j--;
  						}
  						else {
  							a--;
  							arr.add(i);
  							i++;
  						}
  						count++;
  					}
  //					out.println(arr + " " + a + " " + b);
  //					out.println(arr);
  					if( 1 < 2) { 
  //					out.println(arr);
  					if( 1 < 2) { 
  						int fst = arr.pollLast();
  						int scnd = arr.pollLast();
  					
  					i--;
  					j++;
  					}
  					if( x!= y) {
  					for( int c = j ; c>= i ; c--) {
  						arr.add(c);
  					}
  					}
  					else {
  						for( int c = i ; c<= j ; c++) {
  							arr.add(c);
  						}
  					}
  					}
  					if(!check &&  a== 0 &&b == 0 ) {
  						while( !arr.isEmpty()) {
  							out.print(arr.pollFirst()+" ");
  						}
  						out.println();
  					}
  					else {
  						out.println(-1);
  					}
  				}
  				else {
  					ArrayDeque<Integer> arr = new ArrayDeque<>();
  					int i = 1;
  					int j = n;
  					int count = 1;
  					arr.add(j);
  					arr.add(i);
  					j--;
  					i++;
  					while( j>=i && (b!=0 || a!= 0)) {
  //						out.println(arr + " " + a + " " + b);
  						if( count %2 != 0){
  							arr.add(j);
  							b--;
  							j--;
  						}
  						else {
  							a--;
  							arr.add(i);
  							i++;
  						}
  						count++;
  					}
  //					out.println(arr + " " + a + " " + b);
  					int fst = arr.pollLast();
  					int scnd = arr.pollLast();
  					i--;
  					j++;
  					for( int c = i ; c<= j ; c++) {
  						arr.add(c);
  					}
  					if( a== 0 &&b == 0) {
  						while( !arr.isEmpty()) {
  							out.print(arr.pollFirst()+" ");
  						}
  						out.println();
  					}
  					else {
  						out.println(-1);
  					}
  				}
  			}
  			out.flush();
  		}
  		/*
  		 * WARNING -> DONT EVER USE ARRAYS.SORT() IN ANY WAY.
  		 * FIRST AND VERY IMP -> READ AND UNDERSTAND THE QUESTION VERY CAREFULLY.
  		 * WARNING -> DONT CODE BULLSHIT , ALWAYS CHECK THE LOGIC ON MULTIPLE TESTCASES AND EDGECASES BEFORE. 
  		 * SECOND -> TRY TO FIND RELEVENT PATTERN SMARTLY.
  		 * WARNING -> IF YOU THINK YOUR SOLUION IS JUST DUMB DONT SUBMIT IT BEFORE RECHECKING ON YOUR END.
  		 */
  		public static boolean ifpowof2(long n ) {
  			return ((n&(n-1)) == 0);
  		}
  		
  		static boolean isprime(long x ) {
  			if( x== 2) {
  				return true;
  			}
  			if( x%2 == 0) {
  				return false;
  			}
  			for( long i = 3 ;i*i <= x ;i+=2) {
  				if( x%i == 0) {
  					return false;
  				}	
  			}
  			return true;
  		}
  		
  		static boolean[] sieveOfEratosthenes(long n) { 
  			boolean prime[] = new boolean[(int)n + 1];
  			for (int i = 0; i <= n; i++) {
  				prime[i] = true;
  			}
  			for (long p = 2; p * p <= n; p++) {   
  				if (prime[(int)p] == true) {
  					for (long i = p * p; i <= n; i += p)
  						prime[(int)i] = false;
  				}
  			}		 
  			return prime;
  		}
  		
  		public static int[] nextLargerElement(int[] arr, int n)	{ 
  			Stack<Integer> stack = new Stack<>();
  			int rtrn[] = new int[n];
  			rtrn[n-1] = -1;
  	        stack.push( n-1);
  	        for( int i = n-2 ;i >= 0 ; i--){
  	            int temp = arr[i];
  	            int lol = -1;
  	            while( !stack.isEmpty() && arr[stack.peek()] <= temp){
  	            	if(arr[stack.peek()] == temp ) {
  	            		lol = stack.peek();
  	            	}
  	                stack.pop();
  	            }
  	            if( stack.isEmpty()){
  	            	if( lol != -1) {
  	            		rtrn[i] = lol;
  	            	}
  	            	else {
  	            		rtrn[i] = -1;
  	            	}
  	            }
  	            else{
  	            	rtrn[i] = stack.peek();
  	            }
  	            stack.push( i);
  	        }
  	        return rtrn;
  		}
  		
  		static void mysort(int[] arr) {
  			for(int i=0;i<arr.length;i++) {
  	            int rand = (int) (Math.random() * arr.length);
  	            int loc = arr[rand];
  	            arr[rand] = arr[i];
  	            arr[i] = loc;
  	        }
  	        Arrays.sort(arr);
  	    }
  		
  		
  		static void mySort(long[] arr) {
  	        for(int i=0;i<arr.length;i++) {
  	            int rand = (int) (Math.random() * arr.length);
  	            long loc = arr[rand];
  	            arr[rand] = arr[i];
  	            arr[i] = loc;
  	        }
  	        Arrays.sort(arr);
  	    }
  		
  		static long gcd(long a, long b)
  		{
  			if (a == 0)
  				return b;
  			return gcd(b % a, a);
  		}
  		
  			   
  		 static long lcm(long a, long b)
  		 {
  			 return (a / gcd(a, b)) * b;
  		 }
  		 
  
  		 static long rightmostsetbit(long n) {
  			 return n&-n;
  		 }
  		 
  		 static long leftmostsetbit(long n)
  		    {
  		        long k = (long)(Math.log(n) / Math.log(2));
  		        return 1 << k;
  		    }
  	 
  		 static HashMap<Long,Long> primefactor( long n){
  			 HashMap<Long ,Long> hm = new HashMap<>();
  			 long temp = 0;
  			 while( n%2 == 0) {
  				 temp++;
  				 n/=2;
  			 }	
  			 if( temp!= 0) {
  				 hm.put( 2L, temp);
  			 }
  			 long c = (long)Math.sqrt(n);
  			 for( long i = 3 ; i <= c ; i+=2) {
  				 temp = 0;
  				 while( n% i == 0) {
  					 temp++;
  					 n/=i;
  				 }
  				 if( temp!= 0) {
  					 hm.put( i, temp);
  				 }
  	 		 }
  	 		 if( n!= 1) {
  	 			 hm.put( n , 1L);
  	 		 }
  	 		 return hm;	
  		 }
  		 
  		 
  		 static ArrayList<Integer> allfactors(int abs) {
  			 HashMap<Integer,Integer> hm = new HashMap<>();
  			 ArrayList<Integer> rtrn = new ArrayList<>();
  			 for( int i = 2 ;i*i <= abs; i++) {
  				 if( abs% i == 0) {
  					 hm.put( i , 0);
  					 hm.put(abs/i, 0);
  				 }
  			 }
  			 for( int x : hm.keySet()) {
  				 rtrn.add(x);
  			 }
  			 
  			 if( abs != 0) {
  				 rtrn.add(abs);
  			 }
  			 
  			 return rtrn;
  		 }
  			
  	 
  		 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;
  			 }
  		 }	
  }
  
  
  