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.Arrays;
  import java.util.StringTokenizer;
  
  public class TaskB {
  
      public static void main(String[] arg) throws FileNotFoundException {
          final FastScanner in = new FastScanner(System.in);
          final PrintWriter out = new PrintWriter(System.out);
          final int T = in.nextInt();
          for (int t = 1; t <= T; t++) {
              final int n = in.nextInt();
              final int a = in.nextInt();
              final int b = in.nextInt();
              final int[] arr = solution(n, a, b);
              StringBuilder sb = new StringBuilder();
              for (int i = 0; i < arr.length; i++) {
                  sb.append(arr[i]).append(' ');
              }
              out.println(sb.toString());
          }
          out.flush();
          out.close();
          in.close();
      }
  
      private static int[] solution2(final int n,
                                     final int maxCnt,
                                     final int minCnt) {
          int min = 1;
          int max = n;
          final int[] NO = new int[]{-1};
          int[] res = new int[n];
          int locMin = 0;
          int locMax = 0;
          return res;
      }
  
      private static int[] solution(final int n,
                                    int a,
                                    int b) {
          final int[] NO = new int[]{-1};
          if (Math.abs(a - b) > 1) {
              return NO;
          }
          final int[] res = new int[n];
          if (a > b) {
              for (int i = 0; i < n; i++) {
                  res[i] = n - i;
              }
              int tem = a;
              a = b;
              b = tem;
          } else {
              for (int i = 1; i <= n; i++) {
                  res[i - 1] = i;
              }
          }
          int i = 1;
          int locmin = 0;
          int locmax = 0;
          if (a >= b) {
              i = 2;
          }
          for (; i < n; i += 2) {
              if (locmin >= b && locmax >= a) {
                  break;
              }
              int t = res[i];
              res[i] = res[i - 1];
              res[i - 1] = t;
              if (i != n && i != 1) {
                  locmax++;
              }
              if (i != n - 1) {
                  locmin++;
              }
          }
          if (locmax != a) {
              return NO;
          }
          if (locmin != b) {
              return NO;
          }
          return res;
      }
  
  
      private static class FastScanner {
          BufferedReader br;
          StringTokenizer st;
  
          FastScanner(InputStream stream) {
              try {
                  br = new BufferedReader(new InputStreamReader(stream));
              } catch (Exception e) {
                  e.printStackTrace();
              }
          }
  
          String next() {
              while (st == null || !st.hasMoreTokens()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
  
          int nextInt() {
              return Integer.parseInt(next());
          }
  
          int[] readIntArr(int n) {
              int[] result = new int[n];
              for (int i = 0; i < n; i++) {
                  result[i] = Integer.parseInt(next());
              }
              return result;
          }
  
          long[] readLongArr(int n) {
              long[] result = new long[n];
              for (int i = 0; i < n; i++) {
                  result[i] = Long.parseLong(next());
              }
              return result;
          }
  
          void close() {
              try {
                  br.close();
              } catch (IOException e) {
                  e.printStackTrace();
              }
          }
  
          long nextLong() {
              return Long.parseLong(next());
          }
  
      }
  
  }
  