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.StringTokenizer;
  
  /**
   * Accomplished using the EduTools plugin by JetBrains https://plugins.jetbrains.com/plugin/10081-edutools
   */
  
  
  public class Main {
     public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, in, out);
        out.close();
     }
  
     public static class Task {
  
        private boolean[] notPrime;
  
        private void init() {
           notPrime = new boolean[1000002];
           for(int i=2;i<=1000001;i++) {
              for(int j=2;j*i<=1000001;j++) {
                 notPrime[i*j] = true;
              }
           }
        }
  
        private boolean isPrime(Integer num) {
           return !notPrime[num];
        }
  
        public void solve(int cnt, InputReader in, PrintWriter out) {
           cnt = in.nextInt();
           for (int c = 0; c < cnt; c++) {
              int n = in.nextInt();
              int a = in.nextInt();
              int b = in.nextInt();
              if(Math.abs(a-b)>1 || (a+b+2)>n) {
                 out.println(-1);
              } else {
                 if(b>a) {
                    for(int i=n-a-1;i>=b+1;i--) {
                       out.print(i+" ");
                    }
                    int ta = a, tb=b;
                    while (ta>0 || tb>0) {
                       if(tb>0) {
                          out.print((b-tb+1)+" ");
                          tb--;
                       }
                       if(ta>0) {
                          out.print((n-(a-ta))+" ");
                          ta--;
                       }
                    }
                    out.print(n-a);
                 } else {
                    for(int i=b+1;i<=n-a-1;i++) {
                       out.print(i+" ");
                    }
                    int ta = a, tb=b;
                    while (ta>0 || tb>0) {
                       if(ta>0) {
                          out.print((n-(a-ta))+" ");
                          ta--;
                       }
                       if(tb>0) {
                          out.print((b-tb+1)+" ");
                          tb--;
                       }
                    }
                    out.print(n-a);
                 }
                 out.println();
              }
           }
        }
     }
  
     static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;
  
        public InputReader(InputStream stream) {
           reader = new BufferedReader(new InputStreamReader(stream), 32768);
           tokenizer = null;
        }
  
        public String next() {
           while (tokenizer == null || !tokenizer.hasMoreTokens()) {
              try {
                 tokenizer = new StringTokenizer(reader.readLine());
              } catch (IOException e) {
                 throw new RuntimeException(e);
              }
           }
           return tokenizer.nextToken();
        }
  
        public int nextInt() {
           return Integer.parseInt(next());
        }
  
     }
  }