output_description: Print an integer representing the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N K
      A_1 A_2 \cdots A_N
attempt: A, B = input().split()
  if int(A) <= 8 and int(B) <= 8:
      print("Yay!")
  else:
      print(":(")
  
problem_description: Statement
  
  We have N logs of lengths A_1,A_2,\cdots A_N.
  
  We can cut these logs at most K times in total. When a log of length L is cut
  at a point whose distance from an end of the log is t (0<t<L), it becomes two
  logs of lengths t and L-t.
  
  Find the shortest possible length of the longest log after at most K cuts, and
  print it after rounding up to an integer.
samples: [{"input": "2 3\n    7 9", "output": "4\n    \n\n  * First, we will cut the log of length 7 at a point whose distance from an end of the log is 3.5, resulting in two logs of length 3.5 each.\n  * Next, we will cut the log of length 9 at a point whose distance from an end of the log is 3, resulting in two logs of length 3 and 6.\n  * Lastly, we will cut the log of length 6 at a point whose distance from an end of the log is 3.3, resulting in two logs of length 3.3 and 2.7.\n\nIn this case, the longest length of a log will be 3.5, which is the shortest\npossible result. After rounding up to an integer, the output should be 4.\n\n* * *"}, {"input": "3 0\n    3 4 5", "output": "5\n    \n\n* * *"}, {"input": "10 10\n    158260522 877914575 602436426 24979445 861648772 623690081 433933447 476190629 262703497 211047202", "output": "292638192"}]