You are playing a game with a bag of red and black balls. Initially, you are told that the bag has n balls total. In addition, you are also told that the bag has probability p_i / 10⁶ of containing exactly i red balls.

You now would like to buy balls from this bag. You really like the color red, so red balls are worth a unit of 1, while black balls are worth nothing. To buy a ball, if there are still balls in the bag, you pay a cost c with 0 ≤ c ≤ 1, and draw a ball randomly from the bag. You can choose to stop buying at any point (and you can even choose to not buy anything at all).

Given that you buy optimally to maximize the expected profit (i.e. # red balls - cost needed to obtain them), print the maximum expected profit.

The first line of input will contain two integers n, X (1 ≤ n ≤ 10 000, 0 ≤ X ≤ 10⁶).

The next line of input will contain n + 1 integers p₀, p₁, ... p_n (0 ≤ p_i ≤ 10⁶, )

The value of c can be computed as .

Print a single floating point number representing the optimal expected value.

Your answer will be accepted if it has absolute or relative error at most 10^- 9. More specifically, if your answer is a and the jury answer is b, your answer will be accepted if .