Construction#7329
After completing the construction of his country house, Stepan was left with wooden planks of lengths l_1, \ldots, l_n. He decided to use them to build a small pier from which he could comfortably fish.
Stepan firmly believes that the longer the pier, the more fish he will be able to catch!
Like many fishermen, he is also superstitious and follows certain traditions. According to one of them, the pier must be built only from whole planks: planks may be cut, but they must not be joined together.
Now Stepan wants to determine the maximum possible length of the pier if it must consist of exactly planks.
Contains integers , , l_i (1 \le n \le 10000,\ 1 \le m,\ l_i \le 2 \cdot 10^9) — the number of available planks, the number of planks the pier must consist of, and the lengths of the available planks.
Print a single integer — the maximum possible length of a pier plank, or if building the pier is impossible.
Example 1