# Problem:

A video game consists of $n$ levels.
In level $i=1,/ldots,n$ a distance of $x_i$ millimeters needs to be crossed.
Your character moves at a speed of one meter per second.
You want to beat the game as fast as possible.
You may choose any positive real number $f$ of at most $M$ to be the frame rate of the game.
Then your character will move $1000/f$ millimeters per frame and each frame will take $1/f$ seconds.
Frames are discrete and each level needs to be finished separately.
What is the fastest time in which you can beat the game?

# Input:

The first line of input contains two integers $1\leq n\leq 1e4$ and $10\leq M\leq 200$ representing the number of levels and the maximum frame rate.
The following $n$ lines of input, the $i$'th of which contains one integer $1\leq x_i\leq 1e6$ representing the distance that needs to be crossed in level $i$.
It is guaranteed that the total distance that needs to be crossed across all levels is at most $5$ kilometers.

# Output:

Output one line with one floating point value representing the fastest possible time to beat the game.
The answer needs to be within an absolute or relative error of at most $1e-6$.