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: from sys import stdin,stdout,setrecursionlimit
  from math import gcd,sqrt,factorial,pi,inf
  from collections import deque,defaultdict
  from bisect import bisect,bisect_left
  from time import time
  from itertools import permutations as per
  from heapq import heapify,heappush,heappop,heappushpop
  input=stdin.readline
  R=lambda:map(int,input().split())
  I=lambda:int(input())
  S=lambda:input().rstrip('\r\n')
  L=lambda:list(R())
  P=lambda x:stdout.write(str(x)+'\n')
  lcm=lambda x,y:(x*y)//gcd(x,y)
  nCr=lambda x,y:(f[x]*inv((f[y]*f[x-y])%N))%N
  inv=lambda x:pow(x,N-2,N)
  sumx=lambda x:(x**2+x)//2
  N=10**9+7
  
  #1 3 2 5 4
  
  for _ in range(I()):
      n,a,b=R()
      ans=[i+1 for i in range(n)]
      if abs(a-b)>1 or a+b+2>n:
          print(-1)
      elif a>b:
          i=0
          while i<a:
              ans[-1-i*2],ans[-2-i*2]=ans[-2-i*2],ans[-1-i*2]
              i+=1
          print(*ans)
      elif a<b:
          i=0
          while i<b:
              ans[i*2],ans[1+2*i]=ans[1+2*i],ans[2*i]
              i+=1
          print(*ans)
      else:
          i=0
          while i<a:
              ans[i * 2+2], ans[1 + 2 * i] = ans[1 + 2 * i], ans[2 * i+2]
              i+=1
          print(*ans)
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  