output_description: If it is impossible to have a non-decreasing sequence, print `-1`. If it is
  possible, print the minimum number of operations required to achieve it.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      A_1 A_2 ... A_N
      B_1 B_2 ... B_N
attempt: N, K, S = map(int, input().split())
  
  ans = [S] * K + [S - 1] * (N - K)
  for a in ans:
      print(a, end=" ")
  print()
  
problem_description: Statement
  
  We have N cards numbered 1, 2, ..., N. Card i (1 \leq i \leq N) has an integer
  A_i written in red ink on one side and an integer B_i written in blue ink on
  the other side. Initially, these cards are arranged from left to right in the
  order from Card 1 to Card N, with the red numbers facing up.
  
  Determine whether it is possible to have a non-decreasing sequence facing up
  from left to right (that is, for each i (1 \leq i \leq N - 1), the integer
  facing up on the (i+1)-th card from the left is not less than the integer
  facing up on the i-th card from the left) by repeating the operation below. If
  the answer is yes, find the minimum number of operations required to achieve
  it.
  
    * Choose an integer i (1 \leq i \leq N - 1). Swap the i-th and (i+1)-th cards from the left, then flip these two cards.
samples: [{"input": "3\n    3 4 3\n    3 2 3", "output": "1\n    \n\nBy doing the operation once with i = 1, we have a sequence [2, 3, 3] facing\nup, which is non-decreasing.\n\n* * *"}, {"input": "2\n    2 1\n    1 2", "output": "-1\n    \n\nAfter any number of operations, we have the sequence [2, 1] facing up, which\nis not non-decreasing.\n\n* * *"}, {"input": "4\n    1 2 3 4\n    5 6 7 8", "output": "0\n    \n\nNo operation may be required.\n\n* * *"}, {"input": "5\n    28 15 22 43 31\n    20 22 43 33 32", "output": "-1\n    \n\n* * *"}, {"input": "5\n    4 46 6 38 43\n    33 15 18 27 37", "output": "3"}]