# Raft

Very easy

Execution time limit is 1 second

Runtime memory usage limit is 64 megabytes

Using N wooden logs of length L_{ i} (i = 1..N) you need to construct a raft with M beams of equal length. Find the greatest possible length of the raft P.

## 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.

## Examples

Input #1

Answer #1

Submissions 4K

Acceptance rate 41%