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.*;
  import java.lang.*;
  import static java.lang.Math.*;
  
  // Sachin_2961 submission //
  public class CodeforcesA {
  
      public void solve() {
  
           int n = fs.nInt(), a = fs.nInt(), b = fs.nInt();
           if( a+b+2 > n || abs(a-b)>1){
               out.println("-1");
               return;
           }
           int l = 1,r = n;
           if( a > b ){
               for(int i=1;i<=a;i++){
                   out.print(l+" "+r+" ");
                   l++;
                   r--;
               }
               for(int i=r;i>=l;i--){
                   out.print(i+" ");
               }
           }else if(a < b ){
               for(int i=1;i<=b;i++){
                   out.print(r+" "+l+" ");
                   r--;l++;
               }
               for(int i=l;i<=r;i++){
                   out.print(i+" ");
               }
           }else{
               for(int i=1;i<=a;i++){
                   out.print(r+" "+l+" ");
                   r--;l++;
               }
               for(int i=r;i>=l;i--){
                   out.print(i+" ");
               }
           }
           out.println();
      }
  
      static boolean multipleTestCase = true; static FastScanner fs; static PrintWriter out;
      public void run(){
          fs = new FastScanner();
          out = new PrintWriter(System.out);
          int tc = (multipleTestCase)?fs.nInt():1;
          while (tc-->0)solve();
          out.flush();
          out.close();
      }
      public static void main(String[]args){
          try{
              new CodeforcesA().run();
          }catch (Exception e){
              e.printStackTrace();
          }
  
      }
      static class FastScanner {
          BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
          StringTokenizer st=new StringTokenizer("");
          String n() {
              while (!st.hasMoreTokens())
                  try {
                      st=new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              return st.nextToken();
          }
          String Line()
          {
              String str = "";
              try
              {
                  str = br.readLine();
              }catch (IOException e)
              {
                  e.printStackTrace();
              }
              return str;
          }
          int nInt() {return Integer.parseInt(n()); }
          long nLong() {return Long.parseLong(n());}
          double nDouble(){return Double.parseDouble(n());}
          int[]aI(int n){
              int[]ar = new int[n];
              for(int i=0;i<n;i++)
                  ar[i] = nInt();
              return ar;
          }
      }
      public static void sort(int[] arr){
          ArrayList<Integer> ls = new ArrayList<Integer>();
          for(int x: arr)
              ls.add(x);
          Collections.sort(ls);
          for(int i=0; i < arr.length; i++)
              arr[i] = ls.get(i);
      }
      public static void sort(long[] arr){
          ArrayList<Long> ls = new ArrayList<>();
          for(long x: arr)
              ls.add(x);
          Collections.sort(ls);
          for(int i=0; i < arr.length; i++)
              arr[i] = ls.get(i);
      }
  }