output_description: If there are no sequences that satisfy the conditions, print `-1`.
  
  Otherwise, print N integers. The i-th integer should be the i-th element of
  the sequence that you constructed.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N A B
attempt: n, a, b = input().split()
  n, a, b = int(n), int(a), int(b)
  toshow = []
  flag = False
  if a + b > n + 1 or (a != n and b == 1) or (b != n and a == 1):
      toshow = [-1]
  elif n % 2 == 0:
      if a < n // 2:
          a, b = b, a
          flag = True
      i = -1
      for i in range(a - n // 2):
          toshow.append(i * 2 + 1)
          toshow.append(i * 2 + 2)
      buf = []
      j = i
      for j in range(i + 1, i + b - 1):
          buf.append(j * 2 + 1)
          toshow.append(j * 2 + 2)
      buf.reverse()
      for k in range(j + 1, n // 2):
          toshow.append(k * 2 + 2)
          toshow.append(k * 2 + 1)
      for l in buf[:-1]:
          toshow.append(l)
      if len(buf) > 0:
          toshow.append(buf[-1])
      if flag:
          toshow.reverse()
  else:
      if a < (n + 1) // 2:
          a, b = b, a
          flag = True
      buf = []
      i = -1
      for i in range(b - 2):
          buf.append(i * 2 + 1)
          toshow.append(i * 2 + 2)
      buf.reverse()
      j = i
      for j in range(i + 1, i + a - (n + 1) // 2):
          toshow.append(j * 2 + 1)
          toshow.append(j * 2 + 2)
      for k in range(j + 1, (n + 1) // 2):
          if k * 2 + 1 < n:
              toshow.append(k * 2 + 2)
          toshow.append(k * 2 + 1)
      for l in buf[:-1]:
          toshow.append(l)
      if len(buf) > 0:
          toshow.append(buf[-1])
      if flag:
          toshow.reverse()
  for i in toshow[:-1]:
      print(i, end=" ")
  print(toshow[-1])
  
problem_description: Statement
  
  Determine if there exists a sequence obtained by permuting 1,2,...,N that
  satisfies the following conditions:
  
    * The length of its longest increasing subsequence is A.
    * The length of its longest decreasing subsequence is B.
  
  If it exists, construct one such sequence.
samples: [{"input": "5 3 2", "output": "2 4 1 5 3\n    \n\nOne longest increasing subsequence of this sequence is {2,4,5}, and one\nlongest decreasing subsequence of it is {4,3}.\n\n* * *"}, {"input": "7 7 1", "output": "1 2 3 4 5 6 7\n    \n\n* * *"}, {"input": "300000 300000 300000", "output": "-1"}]