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 os
  import sys
  from io import BytesIO, IOBase
  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")
  for _ in range(int(input())):
      n,a,b=map(int,input().split())
      x,y=a,b
      ans=[0]*n
      if a==b:
          end=n
          for i in range(1,n-1,2):
              if a==0:
                  break
              a-=1
              ans[i]=end
              end-=1
          start=1
          for i in range(2,n-1,2):
              if b==0:
                  break
              b-=1
              ans[i]=start
              start+=1
          for i in range(n):
              if ans[i]==0:
                  ans[i]=start
                  start+=1
      elif a>b:
          if a-b>1:
              print(-1)
              continue
          else:
              end=n
              for i in range(1,n-1,2):
                  if a==0:
                      break
                  a-=1
                  ans[i]=end
                  end-=1
              for i in range(n):
                  if ans[i]==0:
                      ans[i]=end
                      end-=1
      else:
          if b-a>1:
              print(-1)
              continue
          else:
              start=1
              for i in range(1,n-1,2):
                  if b==0:
                      break
                  b-=1
                  ans[i]=start
                  start+=1
              for i in range(n):
                  if ans[i]==0:
                      ans[i]=start
                      start+=1
      a=0
      b=0
      for i in range(1,n-1):
          if ans[i]>ans[i-1] and ans[i]>ans[i+1]:
              a+=1
          elif ans[i]<ans[i-1] and ans[i]<ans[i+1]:
              b+=1
      if a!=x:
          print(-1)
      elif b!=y:
          print(-1)
      elif len(set(ans))!=n:
          print(-1)
      else:
          print(*ans)