Given N wire lengths L1, L2 , ..., LN centimetres. It is required by cutting to get equal segments of the greatest possible length, expressed as an integer number of centimeters. If you can't get K segments even 1 cm long, output 0.
Limits: 1 <= N <= 10,000, 1 <= K <= 10,000, 100 <= Li <= 10,000,000, all integers.
Input: The first line contains numbers
N and
К. In the following
N lines -
L1,
L2, ..., LN, one number per line.
Output: Output one number - the resulting length of the segments.
Examples
input
4 11
802
743
457
539
output
200