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 Test
  {
      final static FastReader fr = new FastReader();
      final static PrintWriter out = new PrintWriter(System.out) ;
      static int mod = (int) 1e9 + 7;
      static long dp[][] ;
  
      static void solve()
      {
          int n = fr.nextInt(), a = fr.nextInt(), b = fr.nextInt();
  
          if (Math.abs(a-b) > 1 || (a+b) > n-2) {
              out.println(-1);
              return ;
          }
  
          int count = 0 ;
  
          if (a > b)
          {
              out.print(1 + " ") ;
              int high = n, low = 2 ;
              for (int i = 0 ; i < b ; i++)
              {
                  out.print(high + " ");
                  out.print(low + " ");
                  high--;
                  low++ ;
              }
  
              for (; high >= low; high--) out.print(high + " ") ;
          }
          else if ( a < b)
          {
              out.print(n + " ");
              int high = n-1, low = 1 ;
  
              for (int i = 0 ; i < a ; i++)
              {
                  out.print(low+" "+ high + " ");
                  low++ ; high-- ;
              }
              for (; low <= high; low++) out.print(low+ " ");
          }
          else {
              out.print(1 + " ");
              int high = n, low = 2 ;
              for (int i = 0 ; i < b ; i++)
              {
                  out.print(high + " ");
                  out.print(low + " ");
                  high--;
                  low++ ;
              }
              for (; low <= high; low++) out.print(low+ " ");
          }
          out.println();
  
  
      }
  
  
      public static void main(String[] args)
      {
          int t  = fr.nextInt() ;
          while (t-- > 0)
          {
              solve() ;
          }
          out.close() ;
      }
  
      static int gcd(int a, int b)
      {
          if (b == 0) return a ;
          return gcd(b,  a%b) ;
      }
  
      static int lower_bound(List<Integer> arr, int key)
      {
          int pos = Collections.binarySearch(arr, key) ;
          if (pos < 0)
          {
              pos = -(pos + 1) ;
          }
          return pos ;
      }
  
      static int upper_bound(List<Long> arr, long key)
      {
          int pos = Collections.binarySearch(arr, key);
          pos++ ;
          if (pos < 0)
          {
              pos = -(pos) ;
          }
          return pos ;
      }
  
  
      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;
          }
      }
  
  
  }