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: // http://codeforces.com/contest/895/problem/C
  
  import java.io.*;
  import java.util.*;
  
  public class B {
      public static void main(String[] args) {
          for (int t = IO.nextInt(), i = 0; i < t; i++)
              new SolB().solve();
          IO.close();
      }
  }
  
  class SolB {
  
      int n, a, b;
  
      SolB() {
          n = IO.nextInt();
          a = IO.nextInt();
          b = IO.nextInt();
      }
  
      void solve() {
          if ( a-b > 1 || a-b < -1 || a+b > n-2) {
              IO.writer.println(-1);
              return;
          }
          int[] res = new int[n];
          if (a >= b) {
              res[0] = 1;
              int st = 2, en = n, maximas = 0, minimas = 0;
              for (int i = 1; i < n; i++) {
                  if (maximas == a && minimas == b) {
                      if (a == b)
                          res[i] = st++;
                      else
                          res[i] = en--;
                      continue;
                  }
                  if (i % 2 == 0) {
                      res[i] = st++;
                      minimas++;
                      continue;
                  }
                  maximas++;
                  res[i] = en--;
              }
          }
          if ( a < b) {
              res[0] = n;
              int st = 1, en = n-1, maximas = 0, minimas = 0;
              for (int i = 1; i < n; i++) {
                  if (maximas == a && minimas == b) {
                      res[i] = st++;
                      continue;
                  }
                  if (i % 2 == 0) {
                      res[i] = en--;
                      maximas++;
                      continue;
                  }
                  res[i] = st++;
                  minimas++;
              }
          }
          for (int i = 0; i < n; i++)
              IO.writer.print(String.format("%d ", res[i]));
          IO.writer.println();
      }
  }
  
  class IO {
      static final BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
      static final PrintWriter writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
  
      static StringTokenizer tokens;
  
      static String readLine() {
          try {
              return reader.readLine();
          } catch (Exception e) {
              throw new RuntimeException(e);
          }
      }
  
      static void initializeTokens() {
          while (null == tokens || !tokens.hasMoreTokens())
              tokens = new StringTokenizer(readLine());
      }
  
      static String next() {
          initializeTokens();
          return tokens.nextToken();
      }
  
      static String next(String delim) {
          initializeTokens();
          return tokens.nextToken(delim);
      }
  
      static int nextInt() {
          return Integer.parseInt(next());
      }
  
      static long nextLong() {
          return Long.parseLong(next());
      }
  
      static void close() {
          try {
              reader.close();
              writer.close();
          } catch (Exception e) {
              throw new RuntimeException(e);
          }
      }
  }