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 sys
  import math
  from sys import stdin, stdout
   
  # TAKE INPUT
  def get_ints_in_variables():
      return map(int, sys.stdin.readline().strip().split())
  def get_int(): return int(input())
  def get_ints_in_list(): return list(
      map(int, sys.stdin.readline().strip().split()))
  def get_list_of_list(n): return [list(
      map(int, sys.stdin.readline().strip().split())) for _ in range(n)]
  def get_string(): return sys.stdin.readline().strip()
   
  def main():
      # Write Your Code Here
      for _ in range(get_int()):
          n,a,b = get_ints_in_variables()
          lb = math.ceil(n/2)-1
          ans = [0 for i in range(n+1)]
          # if abs(a-b) <= 1 then answer exists because two consecitive min or max can not possible 
          if abs(a-b) > 1 or a+b > n-2: # possible answer is a+b <= n-2{because first and last index can not make minimum or maximum}
              print(-1)
              # return
          else:#if lb >= a and lb >= b and (a+b) <= n-2:
              if a>b:
                  cnt = n
                  cnt_loop = a
                  i = 2
                  while i < n+1 and cnt_loop > 0:
                      ans[i] = cnt
                      cnt -= 1
                      cnt_loop -= 1
                      i += 2
                  
                  i = 1
                  while i < n+1:
                      if ans[i] == 0:
                          ans[i] = cnt
                          cnt -= 1
                      i += 1
              elif b > a:
                  cnt = 1
                  cnt_loop = b
                  i = 2
                  while i < n+1 and cnt_loop > 0:
                      ans[i] = cnt
                      cnt += 1
                      cnt_loop -= 1
                      i += 2
                  
                  i = 1
                  while i < n+1:
                      if ans[i] == 0:
                          ans[i] = cnt
                          cnt += 1
                      i += 1
              else:
                  cnt = n
                  cnt_loop = a
                  i = 2
                  while i < n+1 and cnt_loop > 0:
                      ans[i] = cnt
                      cnt -= 1
                      cnt_loop -= 1
                      i += 2
                  
                  cnt = 1
                  i = 1
                  while i < n+1:
                      if ans[i] == 0:
                          ans[i] = cnt
                          cnt += 1
                      i += 1
  
              for i in range(1, n+1):
                  print(ans[i],end=" ")
              print()
          # else:
          #     print(-1)
              
  #  calling main Function
  if __name__ == "__main__":
      main()