e-olymp

Raft

UsingNwooden logs of lengthL i (i = 1..N) you need to construct a raft withMbeams of equal length. Find the greatest possible length of the raftP.

Input

In the first line of the values N and M, the second line the values of the array L.

Output

The value of P.

All numeric values are natural, do not exceed 1000.

Time limit 1 second
Memory limit 64 MiB
Input example #1
3 4
20 70 25
Output example #1
23