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 B {
      void go() {
          // add code
          int n = Reader.nextInt();
          int a = Reader.nextInt();
          int b = Reader.nextInt();
  
          if(2 * a + 1 > n || 2 * b + 1 > n || a + b + 2 > n || Math.abs(a - b) > 1) {
              Writer.print(-1 + "\n");
              return;
          }
  
          int[] arr = new int[n];
          int l = 0;
          int r = n - 1;
          int st1 = 0;
          int st2 = 0;
          if(a >= b) {
              st1 = 1;
              st2 = 2;
          }  else {
              st1 = 2;
              st2 = 1;
          }
  
          for(int i = 0; i < b; i++, l++) {
              arr[2 * i + st2] = l + 1;
          }
  
          for(int i = 0; i < a; i++, r--) {
              arr[2 * i + st1] = r + 1;
          }
  
          if(a > b) {
              for(int i = 0; i < n; i++) {
                  if(arr[i] == 0) {
                      arr[i] = r + 1;
                      r--;
                  }
              }
          } else {
              for(int i = 0; i < n; i++) {
                  if(arr[i] == 0) {
                      arr[i] = l + 1;
                      l++;
                  }
              }
          }
  
  
          for(int i = 0; i < n - 1; i++) {
              Writer.print(arr[i] + " ");
          }
          Writer.print(arr[n - 1] + "\n");
      }
      void solve() {
          for(int T = Reader.nextInt(); T > 0; T--) go();
      }
      void run() throws Exception {
          Reader.init(System.in);
          Writer.init(System.out);
          solve();
          Writer.close();
      }
  
      public static void main(String[] args) throws Exception {
          new B().run();
      }
  
      public static class Reader {
          public static StringTokenizer st;
          public static BufferedReader br;
  
          public static void init(InputStream in) {
              br = new BufferedReader(new InputStreamReader(in));
              st = new StringTokenizer("");
          }
  
          public static String next() {
              while(!st.hasMoreTokens()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      throw new InputMismatchException();
                  }
              }
              return st.nextToken();
          }
  
          public static int nextInt() {
              return Integer.parseInt(next());
          }
  
          public static long nextLong() {
              return Long.parseLong(next());
          }
  
          public static double nextDouble() {
              return Double.parseDouble(next());
          }
      }
  
      public static class Writer {
          public static PrintWriter pw;
  
          public static void init(OutputStream os) {
              pw = new PrintWriter(new BufferedOutputStream(os));
          }
  
          public static void print(String s) {
              pw.print(s);
          }
  
          public static void print(char c) {
              pw.print(c);
          }
  
          public static void print(int x) {
              pw.print(x);
          }
  
          public static void print(long x) {
              pw.print(x);
          }
  
          public static void println(String s) {
              pw.println(s);
          }
  
          public static void println(char c) {
              pw.println(c);
          }
  
          public static void println(int x) {
              pw.println(x);
          }
  
          public static void println(long x) {
              pw.println(x);
          }
  
          public static void close() {
              pw.close();
          }
      }
  }