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: #                 __  .__
  # ______ ___.__._/  |_|  |__   ____   ____
  # \____ <   |  |\   __\  |  \ /  _ \ /    \
  # |  |_> >___  | |  | |   Y  (  <_> )   |  \
  # |   __// ____| |__| |___|  /\____/|___|  /
  # |__|   \/                \/            \/
  for i in range(int(input())):
      length, maximum , minimum = map(int,input().split())
      if abs(maximum - minimum) >= 2 or (maximum + minimum) > (length -2) :
          print(-1)
      else:
          if maximum >= minimum:
              array = []
              for i in range(2,length+1):
                  array.append(i)
              print(1,end = " ")
              while  minimum > 0:
                  print(array[len(array)-1],end = " ")
                  print(array[0] , end = " ")
                  array.pop(0)
                  array.pop(len(array)-1)
                  maximum -=1
                  minimum -=1
              if maximum > minimum:
                  for i in range(len(array)-1,-1,-1):
                      print(array[i] , end = " ")
              else:
                  for i in range(0, len(array)):
                      print(array[i], end=" ")
          else:
              array = []
              for i in range(length-1 , 0,-1):
                  array.append(i)
              print(length, end=" ")
              while maximum > 0:
                  print(array[len(array) - 1], end=" ")
                  print(array[0], end=" ")
                  array.pop(0)
                  array.pop(len(array) - 1)
                  maximum -= 1
                  minimum -= 1
              for i in range(len(array) - 1, -1, -1):
                  print(array[i], end=" ")
          print("")