Cable Master

A programming contest is being organized, and every contestant's computer will be wired in a "star" topology to a single central hub. To seat the contestants at an equal distance from the hub and as far apart from one another as possible, several network cables of exactly the same length are needed.

The stock contains $N$ cables, and the length of each cable is known to the centimeter. The cable master picks one target piece length and then cuts every cable into pieces of that length with centimeter precision. A cable of length $L$ yields at most $\lfloor L / x \rfloor$ pieces of length $x$, and any leftover is discarded.

Determine the maximum possible length of a single piece so that $K$ equal-length pieces can be cut from the cables in stock. The piece length is chosen with centimeter precision (two digits after the decimal point), and every piece must be at least one centimeter long.

The first line contains two integers $N$ and $K$ separated by a space. $N$ ($1 \le N \le 10000$) is the number of cables in stock, and $K$ ($1 \le K \le 10000$) is the number of pieces required. Each of the following $N$ lines contains the length of one cable in meters. Every cable is at least 1 meter and at most 100 kilometers long, and all lengths are given with centimeter precision — exactly two digits after the decimal point.

Print the maximum length, in meters, of the pieces that can be cut from the stock to obtain $K$ pieces. Print the value with centimeter precision — exactly two digits after the decimal point.

If it is impossible to cut $K$ pieces each at least one centimeter long, print the single number 0.00.