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: import sys
  
  readline = sys.stdin.buffer.readline
  sys.setrecursionlimit(10**7)
  
  
  def readstr():
      return readline().rstrip().decode()
  
  
  def readstrs():
      return list(readline().decode().split())
  
  
  def readint():
      return int(readline())
  
  
  def readints():
      return list(map(int, readline().split()))
  
  
  def printrows(x):
      print("\n".join(map(str, x)))
  
  
  n, a, b = readints()
  
  if a + b - 1 > n:
      ans = -1
  else:
      if (a * (a - 1) + b * (b + 1)) // 2 >= n:
          ans = []
          B = 0
          A = n + 1
          blen = b
          alen = a - 1
          flag = 1
          while B + 1 != A:
              lim = min(B + blen, A - 1)
              for i in range(lim, B, -1):
                  ans.append(i)
              B = lim
              blen -= 1
              lim = max(A - alen, B + 1)
              for i in range(lim, A):
                  ans.append(i)
              A = lim
              alen -= 1
      elif (a * (a + 1) + b * (b - 1)) // 2 >= n:
          ans = []
          B = 0
          A = n + 1
          blen = b - 1
          alen = a
          flag = 1
          while B + 1 != A:
              lim = max(A - alen, B + 1)
              for i in range(lim, A):
                  ans.append(i)
              A = lim
              alen -= 1
              lim = min(B + blen, A - 1)
              for i in range(lim, B, -1):
                  ans.append(i)
              B = lim
              blen -= 1
      else:
          ans = -1
  
  
  if ans == -1:
      print(ans)
  else:
      printrows(ans)
  
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"}]