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.Scanner;
  
  import javax.swing.text.html.StyleSheet;
  
  public class B_Build_the_Permutation{
      public static void main(String[] args) {
          Scanner scan = new Scanner(System.in);
          int testCases = scan.nextInt();
          while(testCases-->0){
              int n = scan.nextInt();
  
              int maximums = scan.nextInt();
              int minimus = scan.nextInt();
  
              int needed = maximums+minimus+2;
              int difference = Math.abs(maximums-minimus);
  
              if(needed<=n && (difference==0||difference==1)){
                  int[] valsNeeded = new int[needed];
                  if(maximums>=minimus){
                      int dif = n-needed;
                      for(int i = 0;i<needed;i++){
                          valsNeeded[i] =i+1+dif;                        
                      }
                      for(int i = 1;i<=dif;i++){
                          System.out.print(i+" ");
                      }
                  }else{
                      for(int i = n;i>needed;i--){
                          System.out.print(i+" ");
  
                      }
                      int counter = n-(n-needed);
                      for(int i = 0;i<needed;i++){
                          valsNeeded[i] = counter;                      
                          counter--;
                      }
  
                  }
                  int startIndex = 0;
                  int endIndex = needed-1;
  
  
  
                  while(startIndex<endIndex){
                      System.out.print(valsNeeded[startIndex]+" ");
                      System.out.print(valsNeeded[endIndex]+" ");
                      startIndex++;
                      endIndex--;
                  }
  
                  if(needed%2==1){
                      System.out.print(valsNeeded[endIndex]+" ");
                  }
                  System.out.println();
              }else{
                  System.out.println(-1);
              }
          }
      }
  }