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.math.*;
  import java.util.* ;
  import java.io.* ;
  @SuppressWarnings("unused")
  public class B
  {	
  	static final int mod = (int)1e9+7 ;
  	static final double pi = 3.1415926536 ;
  	static boolean not_prime[] = new boolean[1000001] ;
  	static void sieve() {
  		for(int i=2 ; i*i<1000001 ; i++) {
  			if(not_prime[i]==false) {
  				for(int j=2*i ; j<1000001 ; j+=i) {
  					not_prime[j]=true ;
  				}
  			}
  		}not_prime[0]=true ; not_prime[1]=true ;
  	}	
  	public static long bexp(long base , long power)
  	{
  		long res=1L ;
  		
  		base = base%mod ;
  		
  		while(power>0) {
  			if((power&1)==1) {
  				res=(res*base)%mod ;
  				power-- ;
  			}
  			else {
  				base=(base*base)%mod ;
  				power>>=1 ;
  			}
  		}
  		
  		return res ;
  	}
  	static long modInverse(long n, long p){return power(n, p - 2, p); }
  	static long power(long x, long y, long p)
  	{
  	  
  	    // Initialize result
  	    long res = 1;
  	    x = x % p;
  	  
  	    while (y > 0) {
  	  
  	        if (y % 2 == 1)
  	            res = (res * x) % p;
  	        
  	        y = y >> 1;
  	        x = (x * x) % p;
  	    }
  	  
  	    return res;
  	}
  	static long nCrModPFermat(int n, int r, long p){if(n<r) return 0 ;if (r == 0)return 1; long[] fac = new long[n + 1];fac[0] = 1;for (int i = 1; i <= n; i++)fac[i] = fac[i - 1] * i % p;return (fac[n] * modInverse(fac[r], p) % p* modInverse(fac[n - r], p) % p) % p;}
  	static long mod_add(long a, long b){ return ((a % mod) + (b % mod)) % mod; }
  	static long mod_sub(long a, long b){ return ((a % mod) - (b % mod) + mod) % mod; }
  	static long mod_mult(long a, long b){ return ((a % mod) * (b % mod)) % mod; }	
  	static long lcm(int a, int b){ return (a / gcd(a, b)) * b; }
  	static long gcd(long a, long b){if (b == 0) {return a;}return gcd(b, a % b);}
  
  
  	public static void main(String[] args)throws IOException//throws FileNotFoundException
      {
  		FastReader in = new FastReader() ;
  		StringBuilder op = new StringBuilder() ;
  		int T = in.nextInt() ;
  //		int T=1 ;
  		for(int tt=0 ; tt<T ; tt++)
  		{
  
  			int n = in.nextInt() ;
  			int a = in.nextInt() ;
  			int b = in.nextInt() ;
  			
  			int maxfill=n ;
  			int minfill=1 ;
  			
  			if(Math.abs(a-b)>1 || a+b>n-2) {
  				op.append("-1\n") ; continue ;
  			}
  			
  			if(a>b) {
  				for(int i=1 ; i<=2*a ; i++) {
  					if((i&1)==1)op.append(minfill++).append(" ") ;
  					else op.append(maxfill--).append(" ") ;
  				}
  				for(int i=2*a+1 ; i<=n ; i++) {
  					op.append(maxfill--).append(" ") ;
  				}
  			}
  			else if(a<b) {
  				for(int i=1 ; i<=2*b ; i++) {
  					if((i&1)==1)op.append(maxfill--).append(" ") ;
  					else op.append(minfill++).append(" ") ;
  				}
  				for(int i=2*b+1 ; i<=n ; i++) {
  					op.append(minfill++).append(" ") ;
  				}
  			}
  			else if(a!=0){
  				for(int i=1 ; i<=2*a ; i++) {
  					if((i&1)==1)op.append(minfill++).append(" ") ;
  					else op.append(maxfill--).append(" ") ;
  				}
  				for(int i=2*a+1 ; i<=n ; i++) {
  					op.append(minfill++).append(" ") ;
  				}
  			}
  			else {
  				for(int i=1 ; i<=n ; i++)
  					op.append(maxfill--).append(" ") ;
  			}
  			op.append("\n") ;
  		}	
  		System.out.println(op.toString());
      }
  
  	static class pair implements Comparable<pair>
  	{
  		int first , second ;
  		pair(int first , int second){
  			this.first=first ;
  			this.second=second; 
  		}
  		public int compareTo(pair other) {
  			return this.first-other.first ;
  		}
  	}
  	
  	static void sort(int[] a) {
  		ArrayList<Integer> l=new ArrayList<>();
  		for (int i:a) l.add(i);
  		Collections.sort(l);
  		for (int i=0; i<a.length; i++) a[i]=l.get(i);
  	}
  	
  	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;
          }
          
          int[] readArray(int n) {
  			int[] a=new int[n];
  			for (int i=0; i<n; i++) a[i]=nextInt();
  			return a;
  		}
      }
  
  }