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 math
  t = int(input())
  for tc in range(t):
      n,mx,mn = map(int,input().split())
      limit = n-2
      if(mx+mn>limit):
          print(-1)
          continue
      if(abs(mx-mn)>1):
          print(-1)
          continue
      ans = []
      arr1 = None
      arr2 = None
      if(n%2==0):
          arr1 = [i for i in range(1,n//2+1)]
          arr2 = [i for i in range(n,n//2,-1)]
          if(mx<mn):
              arr1,arr2=arr2,arr1
      else:
          if(mx>=mn):
              arr1 = [i for i in range(1,n//2+1)]
              arr2 = [i for i in range(n,n//2,-1)]
          else:
              arr2 = [i for i in range(1,n//2+2)]
              arr1 = [i for i in range(n,n//2+1,-1)]
      cnt = 0
      res = 1
      for i in range(n):
          if(i%2==0):
              try:
                  ans.append(arr1.pop(0))
              except:
                  res=0
                  break
          else:
              try:
                  ans.append(arr2.pop(0))
              except:
                  res = 0
                  break
          if(i!=0 and i%2==0):
              cnt+=1
          if(cnt==min(mn,mx)):
              if(mx<mn):
                  rmx = 1
                  rmn = mn-mx 
              else:
                  rmx = mx-mn
                  rmn = 1
              break
      if(res==0):
          print(-1)
          continue
      if(mx==mn):
          ans = ans+sorted(arr1+arr2)
      else:
          ans = ans+arr1+arr2      
              
      cmn = 0
      cmx = 0
      for i in range(1,n-1):
          if(ans[i]>ans[i-1] and ans[i]>ans[i+1]):
              cmx+=1
          if(ans[i]<ans[i-1] and ans[i]<ans[i+1]):
              cmn+=1
      if(cmx==mx and cmn==mn):
          print(*ans)
      else:
          print(-1)
              