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 stdout, stdin
  from io import IOBase, BytesIO
  from os import read, supports_follow_symlinks, write, fstat
  
  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 = read(self._fd, max(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, size: int = ...):
          while self.newlines == 0:
              b = read(self._fd, max(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:
              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")
  
  
  def print(*args, **kwargs):
      """Prints the values to a stream, or to sys.stdout by default."""
      sep, file = kwargs.pop("sep", " "), kwargs.pop("file", stdout)
      at_start = True
      for x in args:
          if not at_start:
              file.write(sep)
          file.write(str(x))
          at_start = False
      file.write(kwargs.pop("end", "\n"))
      if kwargs.pop("flush", False):
          file.flush()
  
  
  stdin, stdout = IOWrapper(stdin), IOWrapper(stdout)
  def input(): return stdin.readline().rstrip("\r\n")
  
  
  def unioun_max_min(arr1, arr2):
      len1 = len(arr1)
      len2 = len(arr2)
      result = []
      if len1 > len2:
          for i in range(len2):
              result.append(arr1[i])
              result.append(arr2[i])
          result.append(arr1[len1 - 1])
      elif len1 == len2:
          for i in range(len2):
              result.append(arr1[i])
              result.append(arr2[i])
      else:
          for i in range(len1):
              result.append(arr2[i])
              result.append(arr1[i])
          result.append(arr2[len2 - 1])
      return result
  
  
  def main():
      t = int(input())
      for _ in " " * t:
          n, a, b = map(int, input().split())
          if abs(a - b) >= 2 or (a + b) > (n - 2):
              print(-1)
              continue
          init_arr = list(range(1, n + 1))
          if a == 0:
              max_arr = []
          else:
              max_arr = init_arr[-a:]
          min_arr = init_arr[:b]
          middle_arr = init_arr[b:n-a]
          final_middle_arr = unioun_max_min(min_arr, max_arr)
          result = [middle_arr[0]] + final_middle_arr
          if a >= b:
              result = result + middle_arr[1:][::-1]
          else:
              result = result + middle_arr[1:]
          if len(result) != n:
              result = result[:-1]
          if a == 0 and b == 0:
              print(*init_arr)
              continue
          print(*result)
  
  
  if __name__ == "__main__":
      main()
  