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: print(-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"}]