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.*;
  import java.math.BigInteger;
  
  public class code{
  
  	static class Reader
      {
          final private int BUFFER_SIZE = 1 << 16;
          private DataInputStream din;
          private byte[] buffer;
          private int bufferPointer, bytesRead;
  
          public Reader()
          {
              din = new DataInputStream(System.in);
              buffer = new byte[BUFFER_SIZE];
              bufferPointer = bytesRead = 0;
          }
  
          public Reader(String file_name) throws IOException
          {
              din = new DataInputStream(new FileInputStream(file_name));
              buffer = new byte[BUFFER_SIZE];
              bufferPointer = bytesRead = 0;
          }
  
          public String readLine() throws IOException
          {
              byte[] buf = new byte[64]; // line length
              int cnt = 0, c;
              while ((c = read()) != -1)
              {
                  if (c == '\n')
                      break;
                  buf[cnt++] = (byte) c;
              }
              return new String(buf, 0, cnt);
          }
  
          public int nextInt() throws IOException
          {
              int ret = 0;
              byte c = read();
              while (c <= ' ')
                  c = read();
              boolean neg = (c == '-');
              if (neg)
                  c = read();
              do
              {
                  ret = ret * 10 + c - '0';
              }  while ((c = read()) >= '0' && c <= '9');
  
              if (neg)
                  return -ret;
              return ret;
          }
  
          public long nextLong() throws IOException
          {
              long ret = 0;
              byte c = read();
              while (c <= ' ')
                  c = read();
              boolean neg = (c == '-');
              if (neg)
                  c = read();
              do {
                  ret = ret * 10 + c - '0';
              }
              while ((c = read()) >= '0' && c <= '9');
              if (neg)
                  return -ret;
              return ret;
          }
  
          public double nextDouble() throws IOException
          {
              double ret = 0, div = 1;
              byte c = read();
              while (c <= ' ')
                  c = read();
              boolean neg = (c == '-');
              if (neg)
                  c = read();
  
              do {
                  ret = ret * 10 + c - '0';
              }
              while ((c = read()) >= '0' && c <= '9');
  
              if (c == '.')
              {
                  while ((c = read()) >= '0' && c <= '9')
                  {
                      ret += (c - '0') / (div *= 10);
                  }
              }
  
              if (neg)
                  return -ret;
              return ret;
          }
  
          private void fillBuffer() throws IOException
          {
              bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
              if (bytesRead == -1)
                  buffer[0] = -1;
          }
  
          private byte read() throws IOException
          {
              if (bufferPointer == bytesRead)
                  fillBuffer();
              return buffer[bufferPointer++];
          }
  
          public void close() throws IOException
          {
              if (din == null)
                  return;
              din.close();
          }
      }
  
  	public static int GCD(int a, int b)
      {
        if (b == 0)
          return a;
        return GCD(b, a % b);
      }
  
      public static ArrayList<ArrayList<Integer>> al;
  
      //@SuppressWarnings("unchecked")
  	public static void main(String[] arg) throws IOException{
  		//Reader in=new Reader();
  		
  		PrintWriter out = new PrintWriter(System.out);
          Scanner in = new Scanner(System.in);
  		
          int t=in.nextInt();
          
          while(t-- > 0){
              int n=in.nextInt();
              int a=in.nextInt();
              int b=in.nextInt();
  
              if(Math.abs(a-b)>1 || a>((n-1)/2) || b>((n-1)/2) || n-(a+b)<=1){
                  out.println(-1);
                  continue;
              }
  
              int[] arr=new int[n];
              int res=1;
              int l1=a,l2=b;
              if(a==b){
                  for(int i=0;i<n && a>=0;i+=2){
                      arr[i]=res;
                      res++;
                      a--;
                  }
                  for(int i=1;i<n && b>0;i+=2){
                      arr[i]=res;
                      res++;
                      b--;
                  }
                  for(int i=0;i<n;i++){
                      if(arr[i]==0) arr[i]=i+1;
                  }
              }
  
              else if(a>b){
                  //a=b;
                  for(int i=0;i<n && l1>0;i+=2){
                      arr[i]=res;
                      res++;
                      l1--;
                  }
                  for(int i=1;i<n && l2>0;i+=2){
                      arr[i]=res++;
                      l2--;
                  }
                  res=n;
                  arr[a+b]=res--;
                  for(int i=a+b+1;i<n;i++){
                      arr[i]=res--;
                  }
              }
  
              else{
                  //b=a;
                  
                  res=n;
                  //out.println(a+" "+b+" "+res);
                  for(int i=0;i<n && l2>0;i+=2){
                      
                      arr[i]=res--;
                      l2--;
                      //out.println(i+" "+arr[i]);
                  }
                  for(int i=1;i<n && l1>0;i+=2){
                      arr[i]=res--;
                      l1--;
                      //out.println(i+" "+arr[i]);
                  }
                  res=1;
                  arr[a+b]=res++;
                  for(int i=a+b+1;i<n;i++){
                      arr[i]=res++;
                      //out.println(i+" "+arr[i]);
                  }
              }
  
              for(int i=0;i<n;i++){
                  out.print(arr[i]+" ");
              }
              out.println();
          }
  
          out.flush();
      }
  
     
  }
  