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
  
  
  t = int(stdin.readline())
  for tt in range(t):
      n, a, b = [int(s) for s in stdin.readline().split()]
  
      if abs(a - b) > 1 or a + b > n - 2:
          stdout.write('-1\n')
          continue
  
      ar = [i for i in range(n + 1)]
  
      if a >= b:
          li = n
          if a > 0:
              ar[li], ar[li - 1]  = ar[li - 1], ar[li]
              a -= 1
              li -= 2
  
          while a > 0:
              ar[li], ar[li - 1]  = ar[li - 1], ar[li]
              a -= 1
              b -= 1
              li -= 2
  
          if b != 0:
              ar[1], ar[2] = ar[2], ar[1]
      else:
          fi = 1
          if b > 0:
              ar[fi], ar[fi + 1] = ar[fi + 1], ar[fi]
              b -= 1
              fi += 2
  
          while b > 0:
              ar[fi], ar[fi + 1] = ar[fi + 1], ar[fi]
              b -= 1
              a -= 1
              fi += 2
          if a != 0:
              ar[n - 1], ar[n] = ar[n], ar[n - 1]
  
  
      stdout.write(' '.join([str(s) for s in ar[1:]]) + '\n')