Strings
In the morning, it was raining, and everything seemed normal. However, by noon, the sun appeared, and the sanitary inspection arrived at the camp. After thoroughly checking all the cabins and buildings, the inspection team concluded that the clotheslines in the residential cabins did not comply with sanitary standards. Specifically, each cabin must have exactly one clothesline, and all clotheslines must be of identical length. The camp currently has n clotheslines and k cabins. To avoid the camp's closure, the existing clotheslines must be cut so that there are k lines of equal length. The penalty imposed is inversely related to the length of the clotheslines installed in the cabins. Therefore, the camp management's goal is to maximize the length of these lines.
Input
The first line contains two integers - n (1 ≤ n ≤ 10001) and k (1 ≤ k ≤ 10001). Each of the following n lines contains one integer representing the length of a clothesline, measured in centimeters. All lengths range from 1 centimeter to 100 kilometers inclusive.
Output
Output a single integer - the maximum possible length of the clotheslines that meet the requirement, in centimeters. If it is impossible to meet the requirement, output 0.