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.*;
  
  public class Main {
      static FastScanner sc = new FastScanner(System.in);
      static PrintWriter pw = new PrintWriter(System.out);
      static StringBuilder sb = new StringBuilder();
      static long mod = (long) 1e9 + 7;
      public static void main(String[] args) throws Exception {
          int n = sc.nextInt();
          for(int i = 0; i < n; i++) solve();
          pw.flush();
      }
  
      public static void solve() {
          int n = sc.nextInt();
          int a = sc.nextInt();
          int b = sc.nextInt();
          int[] ans = new int[n];
          for(int i = 1; i <= n; i++){
              ans[i-1] = i;
          }
          if(a == 0 && b == 0){
              //何もしない   
          }else if(a <= b){
              int rem = b;
              for(int i = 0; i < n-1; i+=2){
                  if(rem == 0){
                      break;
                  }
                  int tmp = ans[i+1];
                  ans[i+1] = ans[i];
                  ans[i] = tmp;
                  rem--;
              }
              if(a == b){
                  int tmp = ans[n-2];
                  ans[n-2] = ans[n-1];
                  ans[n-1] = tmp;
              }
          }else{
              int rem = a;
              for(int i = n-1; i > 1; i-=2){
                  if(rem == 0){
                      break;
                  }
                  int tmp = ans[i-1];
                  ans[i-1] = ans[i];
                  ans[i] = tmp;
                  rem--;
              }
          }
          sb.append(ans[0]).append(" ");
          for(int i = 1; i < n-1; i++){
              if(ans[i-1] < ans[i] && ans[i] > ans[i+1]){
                  a--;
              }else if(ans[i-1] > ans[i] && ans[i] < ans[i+1]){
                  b--;
              }
              sb.append(ans[i]).append(" ");
          }
          sb.append(ans[n-1]);
          if(a == 0 && b == 0){
              pw.println(sb.toString());
          }else{
              pw.println(-1);
          }
          //pw.println(a + " " + b);
          sb.setLength(0);
      }
  
      static class GeekInteger {
          public static void save_sort(int[] array) {
              shuffle(array);
              Arrays.sort(array);
          }
  
          public static int[] shuffle(int[] array) {
              int n = array.length;
              Random random = new Random();
              for (int i = 0, j; i < n; i++) {
                  j = i + random.nextInt(n - i);
                  int randomElement = array[j];
                  array[j] = array[i];
                  array[i] = randomElement;
              }
              return array;
          }
  
          public static void save_sort(long[] array) {
              shuffle(array);
              Arrays.sort(array);
          }
  
          public static long[] shuffle(long[] array) {
              int n = array.length;
              Random random = new Random();
              for (int i = 0, j; i < n; i++) {
                  j = i + random.nextInt(n - i);
                  long randomElement = array[j];
                  array[j] = array[i];
                  array[i] = randomElement;
              }
              return array;
          }
  
      }
  }
  
  class FastScanner {
      private BufferedReader reader = null;
      private StringTokenizer tokenizer = null;
  
      public FastScanner(InputStream in) {
          reader = new BufferedReader(new InputStreamReader(in));
          tokenizer = null;
      }
  
      public FastScanner(FileReader in) {
          reader = new BufferedReader(in);
          tokenizer = null;
      }
  
      public String next() {
          if (tokenizer == null || !tokenizer.hasMoreTokens()) {
              try {
                  tokenizer = new StringTokenizer(reader.readLine());
              } catch (IOException e) {
                  throw new RuntimeException(e);
              }
          }
          return tokenizer.nextToken();
      }
  
      public String nextLine() {
          if (tokenizer == null || !tokenizer.hasMoreTokens()) {
              try {
                  return reader.readLine();
              } catch (IOException e) {
                  throw new RuntimeException(e);
              }
          }
          return tokenizer.nextToken("\n");
      }
  
      public long nextLong() {
          return Long.parseLong(next());
      }
  
      public int nextInt() {
          return Integer.parseInt(next());
      }
  
      public double nextDouble() {
          return Double.parseDouble(next());
      }
  
      public String[] nextArray(int n) {
          String[] a = new String[n];
          for (int i = 0; i < n; i++)
              a[i] = next();
          return a;
      }
  
      public int[] nextIntArray(int n) {
          int[] a = new int[n];
          for (int i = 0; i < n; i++)
              a[i] = nextInt();
          return a;
      }
  
      public long[] nextLongArray(int n) {
          long[] a = new long[n];
          for (int i = 0; i < n; i++)
              a[i] = nextLong();
          return a;
      }
  }
  