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: # SHRi GANESHA    author: Kunal Verma #
  
  import os
  import random
  import sys
  
  from itertools import *
  
  from io import BytesIO, IOBase
  
  
  def lcm(a, b):
      return (a * b) // gcd(a, b)
  
  
  '''
      mod = 10 ** 9 + 7
      fac = [1]
      for i in range(1, 2 * 10 ** 5 + 1):
          fac.append((fac[-1] * i) % mod)
      fac_in = [pow(fac[-1], mod - 2, mod)]
      for i in range(2 * 10 ** 5, 0, -1):
          fac_in.append((fac_in[-1] * i) % mod)
      fac_in.reverse()
      def comb(a, b):
          if a < b:
              return 0
          return (fac[a] * fac_in[b] * fac_in[a - b]) % mod
  '''
  
  
  # MAXN = 10000004
  # spf = [0 for i in range(MAXN)]
  # adj = [[] for i in range(MAXN)]
  def sieve():
      global spf, adj, MAXN
      spf[1] = 1
      for i in range(2, MAXN):
          spf[i] = i
  
      for i in range(2, MAXN):
          if i * i > MAXN:
              break
          if (spf[i] == i):
              for j in range(i * i, MAXN, i):
                  if (spf[j] == j):
                      spf[j] = i
  
  
  def getdistinctFactorization(n):
      global adj, spf, MAXN
      for i in range(1, n + 1):
          index = 1
          x = i
          if (x != 1):
              adj[i].append(spf[x])
          x = x // spf[x]
          while (x != 1):
              if (adj[i][index - 1] != spf[x]):
                  adj[i].append(spf[x])
                  index += 1
              x = x // spf[x]
  
  
  def printDivisors(n):
      i = 2
      z = [1, n]
      while i <= sqrt(n):
          if (n % i == 0):
              if (n / i == i):
                  z.append(i)
              else:
                  z.append(i)
                  z.append(n // i)
          i = i + 1
      return z
  
  
  def create(n, x, f):
      pq = len(bin(n)[2:])
      if f == 0:
          tt = min
      else:
          tt = max
      dp = [[inf] * n for _ in range(pq)]
      dp[0] = x
      for i in range(1, pq):
          for j in range(n - (1 << i) + 1):
              dp[i][j] = tt(dp[i - 1][j], dp[i - 1][j + (1 << (i - 1))])
      return dp
  
  
  def enquiry(l, r, dp, f):
      if l > r:
          return inf if not f else -inf
      if f == 1:
          tt = max
      else:
          tt = min
      pq1 = len(bin(r - l + 1)[2:]) - 1
      return tt(dp[pq1][l], dp[pq1][r - (1 << pq1) + 1])
  
  
  def SieveOfEratosthenes(n):
      prime = [True for i in range(n + 1)]
      p = 2
      while (p * p <= n):
          if (prime[p] == True):
              for i in range(p * p, n + 1, p):
                  prime[i] = False
          p += 1
      x = []
      for i in range(2, n + 1):
          if prime[i]:
              x.append(i)
      return x
  def solv(z,a,b):
      for i in range(1,len(z)-1):
          if z[i-1]<z[i]>z[i+1]:
              a-=1
          elif z[i-1]>z[i]<z[i+1]:
              b-=1
      if a==b==0:
          return True
      return False
  
  def main():
  
      for _ in range(int(input())):
          n,a,b=map(int,input().split())
          # n=random.choice([6,7,8,9])
          # a=random.randint(0,(n-2)//2)
          # b=random.choice([a,abs(a-1),a+1])
          if abs(a-b)>1 or a+b>n-2:
              print(-1)
          else:
              z=[0]*n
  
              if a==b:
                  i=1
                  z=list(range(1,n+1))
                  for j in range(a):
                      z[i],z[i+1]=z[i+1],z[i]
                      i+=2
  
              elif a>b:
                  pos=1
                  x=n
                  for i in range(a):
                      z[pos]=x
                      pos+=2
                      x-=1
                  for i in range(n):
                      if z[i]==0:
                          z[i]=x
                          x-=1
              else:
                  pos = 1
                  x = 1
                  for i in range(b):
                      z[pos] = x
                      pos += 2
                      x += 1
                  for i in range(n):
                      if z[i] == 0:
                          z[i] = x
                          x += 1
              print(*z)
              # if not solv(z,a,b):
              #     print(n,a,b)
  
  # Fast IO Region
  BUFSIZE = 8192
  
  
  class FastIO(IOBase):
      newlines = 0
  
      def __init__(self, file):
          self._fd = file.fileno()
          self.buffer = BytesIO()
          self.writable = "x" in file.mode or "r" not in file.mode
          self.write = self.buffer.write if self.writable else None
  
      def read(self):
          while True:
              b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
              if not b:
                  break
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines = 0
          return self.buffer.read()
  
      def readline(self):
          while self.newlines == 0:
              b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
              self.newlines = b.count(b"\n") + (not b)
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines -= 1
          return self.buffer.readline()
  
      def flush(self):
          if self.writable:
              os.write(self._fd, self.buffer.getvalue())
              self.buffer.truncate(0), self.buffer.seek(0)
  
  
  class IOWrapper(IOBase):
      def __init__(self, file):
          self.buffer = FastIO(file)
          self.flush = self.buffer.flush
          self.writable = self.buffer.writable
          self.write = lambda s: self.buffer.write(s.encode("ascii"))
          self.read = lambda: self.buffer.read().decode("ascii")
          self.readline = lambda: self.buffer.readline().decode("ascii")
  
  
  sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
  input = lambda: sys.stdin.readline().rstrip("\r\n")
  
  if __name__ == '__main__':
      main()