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 B {
      static PrintWriter pw;
  
      void solve(int n, int a, int b) {
          if (a + b > n - 2 || Math.abs(a - b) > 1) {
              pr(-1);
              return;
          }
          List<Integer> t = new ArrayList<>();
          if (a == b) {
              for (int i = 0; i < a; i++) {
                  t.add(i + 1);
                  t.add(n - i);
              }
              for (int i = 0; i < n - 2 * a; i++) t.add(a + 1 + i);
          } else if (a - b == 1) {
              for (int i = 0; i < a; i++) {
                  t.add(i + 1);
                  t.add(n - i);
              }
              for (int i = 0; i < n - 2 * a; i++) t.add(n - a - i);
          } else if (b - a == 1) {
              for (int i = 0; i <= a; i++) {
                  t.add(n - i);
                  t.add(i + 1);
              }
              for (int i = 0; i < n - (2 * a + 2); i++) t.add(a + 2 + i);
          }
          outputL(t);
      }
  
      void outputL(List<Integer> l) {
          for (int e : l) pw.print(e + " ");
          pr("");
      }
  
      private void run() {
          read_write_file(); // comment this before submission
          FastScanner fs = new FastScanner();
          int t = fs.nextInt();
          while (t-- > 0) {
              int[] a = fs.readArray(3);
              solve(a[0], a[1], a[2]);
          }
      }
  
      private final String INPUT = "input.txt";
      private final String OUTPUT = "output.txt";
  
      void read_write_file() {
          FileInputStream instream = null;
          PrintStream outstream = null;
          try {
              instream = new FileInputStream(INPUT);
              outstream = new PrintStream(new FileOutputStream(OUTPUT));
              System.setIn(instream);
              System.setOut(outstream);
          } catch (Exception e) {
          }
      }
  
      public static void main(String[] args) {
          pw = new PrintWriter(System.out);
          new B().run();
          pw.close();
      }
  
      void pr(int num) {
          pw.println(num);
      }
  
      void pr(long num) {
          pw.println(num);
      }
  
      void pr(double num) {
          pw.println(num);
      }
  
      void pr(String s) {
          pw.println(s);
      }
  
      void pr(char c) {
          pw.println(c);
      }
  
      class FastScanner {
          BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
          StringTokenizer st = new StringTokenizer("");
  
          String next() {
              while (!st.hasMoreTokens())
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              return st.nextToken();
          }
  
          int nextInt() {
              return Integer.parseInt(next());
          }
  
          int[] readArray(int n) {
              int[] a = new int[n];
              for (int i = 0; i < n; i++) a[i] = nextInt();
              return a;
          }
  
          long nextLong() {
              return Long.parseLong(next());
          }
  
          double nextDouble() {
              return Double.parseDouble(next());
          }
      }
  
      void tr(Object... o) {
          pw.println(Arrays.deepToString(o));
      }
  }