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 a {
  
      public static void main(String[] args){
  
          FastScanner sc = new FastScanner();
          int t = sc.nextInt();
          while(t-- > 0){
  
              int n = sc.nextInt();
              int a = sc.nextInt();
              int b = sc.nextInt();
  
              if(a + b > n-2){
                  System.out.println(-1);
                  continue;
              }
  
              if(Math.abs(a-b) > 1){
                  System.out.println(-1);
                  continue;
              }
  
              if(a > b){
              
                  int ans[] = new int[n];
                  for(int i=0; i<a; i++){
                      ans[2*i] = i+1;
                  }
                  for(int i=0; i<b; i++){
                      ans[2*i+1] = n-i;
                  }
  
                  int idx = -1;
                  for(int i=0; i<ans.length; i++){
                      if(ans[i] == 0){
                          idx = i;
                          break;
                      }
                  }
  
                  int count = n-b;
                  for(int i=idx; i<n; i++){
                      ans[i] = count;
                      count--;
                  }
  
                  for(int i=0; i<n; i++){
                      System.out.print(ans[i] + " ");
                  }
                  System.out.println();
  
              }
  
              if(a < b){
              
                  int ans[] = new int[n];
                  for(int i=0; i<b; i++){
                      ans[2*i] = n-i;
                  }
                  for(int i=0; i<a; i++){
                      ans[2*i+1] = i+1;
                  }
  
                  int idx = -1;
                  for(int i=0; i<ans.length; i++){
                      if(ans[i] == 0){
                          idx = i;
                          break;
                      }
                  }
  
                  int count = a+1;
                  for(int i=idx; i<n; i++){
                      ans[i] = count;
                      count++;
                  }
  
                  for(int i=0; i<n; i++){
                      System.out.print(ans[i] + " ");
                  }
                  System.out.println();
  
              }
  
              if(a == b){
  
                  int ans[] = new int[n];
                  for(int i=0; i<a; i++){
                      ans[2*i] = i+1;
                  }
                  for(int i=0; i<b; i++){
                      ans[2*i+1] = n-i;
                  }
  
                  int idx = -1;
                  for(int i=0; i<ans.length; i++){
                      if(ans[i] == 0){
                          idx = i;
                          break;
                      }
                  }
  
                  int count = a+1;
                  for(int i=idx; i<n; i++){
                      ans[i] = count;
                      count++;
                  }
  
                  for(int i=0; i<n; i++){
                      System.out.print(ans[i] + " ");
                  }
                  System.out.println();
  
  
  
              }
  
          }
  
      }
  
  }
  
  class FastScanner
  {
      //I don't understand how this works lmao
      private int BS = 1 << 16;
      private char NC = (char) 0;
      private byte[] buf = new byte[BS];
      private int bId = 0, size = 0;
      private char c = NC;
      private double cnt = 1;
      private BufferedInputStream in;
  
      public FastScanner() {
          in = new BufferedInputStream(System.in, BS);
      }
  
      public FastScanner(String s) {
          try {
              in = new BufferedInputStream(new FileInputStream(new File(s)), BS);
          } catch (Exception e) {
              in = new BufferedInputStream(System.in, BS);
          }
      }
  
      private char getChar() {
          while (bId == size) {
              try {
                  size = in.read(buf);
              } catch (Exception e) {
                  return NC;
              }
              if (size == -1) return NC;
              bId = 0;
          }
          return (char) buf[bId++];
      }
  
      public int nextInt() {
          return (int) nextLong();
      }
  
      public int[] nextInts(int N) {
          int[] res = new int[N];
          for (int i = 0; i < N; i++) {
              res[i] = (int) nextLong();
          }
          return res;
      }
  
      public long[] nextLongs(int N) {
          long[] res = new long[N];
          for (int i = 0; i < N; i++) {
              res[i] = nextLong();
          }
          return res;
      }
  
      public long nextLong() {
          cnt = 1;
          boolean neg = false;
          if (c == NC) c = getChar();
          for (; (c < '0' || c > '9'); c = getChar()) {
              if (c == '-') neg = true;
          }
          long res = 0;
          for (; c >= '0' && c <= '9'; c = getChar()) {
              res = (res << 3) + (res << 1) + c - '0';
              cnt *= 10;
          }
          return neg ? -res : res;
      }
  
      public double nextDouble() {
          double cur = nextLong();
          return c != '.' ? cur : cur + nextLong() / cnt;
      }
  
      public double[] nextDoubles(int N) {
          double[] res = new double[N];
          for (int i = 0; i < N; i++) {
              res[i] = nextDouble();
          }
          return res;
      }
  
      public String next() {
          StringBuilder res = new StringBuilder();
          while (c <= 32) c = getChar();
          while (c > 32) {
              res.append(c);
              c = getChar();
          }
          return res.toString();
      }
  
      public String nextLine() {
          StringBuilder res = new StringBuilder();
          while (c <= 32) c = getChar();
          while (c != '\n') {
              res.append(c);
              c = getChar();
          }
          return res.toString();
      }
  
      public boolean hasNext() {
          if (c > 32) return true;
          while (true) {
              c = getChar();
              if (c == NC) return false;
              else if (c > 32) return true;
          }
      }
  }
  
  