After finishing his chalet construction, Stepan still has $n$ wooden boards, with lengths $l_1, ..., l_n$. He decided to build a fishing deck on a lake using these boards. Stepan believes that the longer deck is, the more fish he will catch! Moreover, Stepan, as all fishermen, is very superstitious and trusts all omens. One of it --- the deck can be build using whole boards only (boards can be cut but not joined). Now Stepan is interested what maximum integer deck length $d$ can be obtained, if needs to use $m$ boards. \InputFile Contains integers $n, m, l_i~(1 \le n \le 10000, 1 \le m, l_i \le 2 \cdot 10^9)$ --- number of available boards, number of boards to be used to build the deck and the lengths of available boards. \OutputFile Print one integer $d$ --- the maximum possible length of the deck or $0$ (zero).