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.util.*;
  
  public class B {
  	public static void main(String args[]){
  		FScanner in = new FScanner();
  		PrintWriter out = new PrintWriter(System.out);
  		int t = in.nextInt();
  		while(t-->0) { 
  			int n =in.nextInt();
  			int a=in.nextInt();
  			int b=in.nextInt();
  
  			if(a+b>(n-2)||(Math.abs(a-b)>1))
  				out.print(-1);
  			else if(a!=0||b!=0)
  			{
  				if(a>b)
  				{
  					int f=1;
  					int s=n;
  					int c=0,f2=0;
  
  					for(int i=1;i<=n;i++)
  					{
  						if(i%2==0)
  						{
  							out.print(s+" ");
  							s--;
  							c++;
  
  						}
  						else
  						{
  							out.print(f+" ");
  							f++;
  						}
  
  						if(c==a)
  						{
  							f2=1;
  							break;
  						}
  					}
  					
  
  					if(f2==1)
  					{
  					for(int i=s;i>=f;i--)
  						out.print(i+" ");
  				    }
  				}
  
  				else if(b>a)
  				{
  					int f=1;
  					int s=n;
  					int c1=0,f1=0;
  
  					for(int i=1;i<=n;i++)
  					{
  						if(i%2==0)
  						{
  							out.print(f+" ");
  							f++;
  						}
  						else
  						{
  							out.print(s+" ");
  							s--;
  							c1++;
  						}
  
  						if(c1==b)
  						{
  							f1=1;
  							break;
  						}
  					}
  
  					if(f1==1)
  					{
  						for(int i=f;i<=s;i++)
  							out.print(i+" ");
  					}
  				}
  
  				else
  				{
  					int f=1;
  					int s=n;
  					int c=0,c1=0,f1=0;
  
  					for(int i=1;i<n;i++)
  					{
  						if(i%2==0)
  						{
  							out.print(f+" ");
  							f++;
  							c++;
  						}
  
  						else
  						{
  							out.print(s+" ");
  							s--;
  							c1++;
  						}
  
  						if(c==a&&c1==b)
  						{
  							f1=1;
  							break;
  						}
  					}
  
  				    if(f1==1)
  				    {
  				    	for(int i=s;i>=f;i--)
  				    		out.print(i+" ");
  				    }
  				}
  			}
  			else
  			{
  				for(int i=1;i<=n;i++)
  					out.print(i+" ");
  			}
  
  			out.println();
  
  
  
  		}
  		out.close();
  	}
  
  	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 boolean checkprime(int n1)
  	{
  		if(n1%2==0||n1%3==0)
  			return false;
  		else 
  		{
  			for(int i=5;i*i<=n1;i+=6)
  			{
  				if(n1%i==0||n1%(i+2)==0)
  					return false;
  			}
  			return true;
  		}
  	}
  	
  	static class FScanner {
  		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  		StringTokenizer sb = new StringTokenizer("");
  
  		String next(){
  			while(!sb.hasMoreTokens()){
  				try{
  					sb = new StringTokenizer(br.readLine());
  				} catch(IOException e){ }
  			}
  			return sb.nextToken();
  		}
  		String nextLine(){
  			try{ return br.readLine(); } 
  			catch(IOException e) { } return "";
  		}
  
  		int nextInt(){
  			return Integer.parseInt(next());
  		}
  
  		long nextLong() {
  			return Long.parseLong(next());
  		}
  
  		int[] readArray(int n) {
  			int a[] = new int[n];
  			for(int i=0;i<n;i++) a[i] = nextInt();
  			return a;
  		}
  
  		float nextFloat(){
  		return Float.parseFloat(next());
  		}
  		
  		double nextDouble(){
  		return Double.parseDouble(next());
  		}
  	}
  }
  