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.*;
  import java.util.regex.MatchResult;
  
  public class B {
  
      public static boolean checker(ArrayList<Integer> a, int max, int min) {
          for (int i = 1; i < a.size() - 1; i++) {
              if (a.get(i) > a.get(i + 1) && a.get(i) > a.get(i - 1)) {
                  max--;
              }
              if (a.get(i) < a.get(i + 1) && a.get(i) < a.get(i - 1)) {
                  min--;
              }
          }
          return max == 0 && min == 0;
      }
  
      public static void main(String[] args) throws IOException {
          Scanner sc = new Scanner(System.in);
          PrintWriter pw = new PrintWriter(System.out);
          int t = sc.nextInt();
          while (t-- > 0) {
              int n = sc.nextInt();
              int max = sc.nextInt();
              int min = sc.nextInt();
              if (max == min) {
                  LinkedList<Integer> big = new LinkedList<>();
                  LinkedList<Integer> small = new LinkedList<>();
                  for (int i = 1; i <= min + 1; i++) {
                      small.add(i);
                  }
                  for (int i = min + 2; i <= n; i++) {
                      big.add(i);
                  }
                  LinkedList<Integer> ans = new LinkedList<>();
  //                System.out.println(small+" "+big);
                  if (max + min + 2 <= n) {
                      for (int i = 0; i < max + min + 2; i++) {
                          if (i % 2 == 0) {
                              ans.addLast(small.pollLast());
                          } else {
                              ans.addLast(big.pollFirst());
                          }
                      }
                      while (!small.isEmpty()) {
                          ans.addLast(small.pollLast());
                      }
                      while (!big.isEmpty()) {
                          ans.addLast(big.pollFirst());
                      }
  //                    System.out.println(ans);
                      for (int x : ans) {
                          pw.print(x + " ");
                      }
                      pw.println();
                  } else {
                      pw.println(-1);
                  }
              } else if (max == min + 1) {
                  LinkedList<Integer> big = new LinkedList<>();
                  LinkedList<Integer> small = new LinkedList<>();
                  for (int i = 1; i <= n - max; i++) {
                      small.add(i);
                  }
                  for (int i = n - max + 1; i <= n; i++) {
                      big.add(i);
                  }
                  LinkedList<Integer> ans = new LinkedList<>();
  //                System.out.println(small+" "+big);
                  if (max + min + 2 <= n) {
                      for (int i = 0; i < max + min + 2; i++) {
                          if (i % 2 == 0) {
                              ans.addLast(small.pollLast());
                          } else {
                              ans.addLast(big.pollFirst());
                          }
                      }
                      while (!small.isEmpty()) {
                          ans.addLast(small.pollLast());
                      }
                      while (!big.isEmpty()) {
                          ans.addLast(big.pollFirst());
                      }
  //                    System.out.println(ans);
                      for (int x : ans) {
                          pw.print(x + " ");
                      }
                      pw.println();
                  } else {
                      pw.println(-1);
                  }
              } else if (max == min - 1) {
                  LinkedList<Integer> big = new LinkedList<>();
                  LinkedList<Integer> small = new LinkedList<>();
                  for (int i = 1; i <= min; i++) {
                      small.add(i);
                  }
                  for (int i = min + 1; i <= n; i++) {
                      big.add(i);
                  }
                  LinkedList<Integer> ans = new LinkedList<>();
                  if (max + min + 2 <= n) {
                      for (int i = 0; i < max + min + 2; i++) {
                          if (i % 2 == 0) {
                              ans.addLast(big.pollFirst());
                          } else {
                              ans.addLast(small.pollLast());
                          }
                      }
  //                    System.out.println(ans);
  
                      while (!big.isEmpty()) {
                          ans.addLast(big.pollFirst());
                      }
                      for (int x : ans) {
                          pw.print(x + " ");
                      }
                      pw.println();
                  } else {
                      pw.println(-1);
                  }
              } else {
                  pw.println(-1);
              }
          }
          pw.close();
      }
  
      static class Scanner {
          BufferedReader br;
          StringTokenizer st;
  
          public Scanner(InputStream s) {
              br = new BufferedReader(new InputStreamReader(s));
          }
  
          public String next() throws IOException {
              while (st == null || !st.hasMoreTokens()) {
                  st = new StringTokenizer(br.readLine());
              }
              return st.nextToken();
          }
  
          public int nextInt() throws IOException {
              return Integer.parseInt(next());
          }
      }
  
  
  }