#abc154d. [abc154_d]Dice in Line

[abc154_d]Dice in Line

Problem Statement

We have NN dice arranged in a line from left to right. The ii-th die from the left shows pip_i numbers from 11 to pip_i with equal probability when thrown.

We will choose KK adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum.

Constraints

  • 1KN2000001 ≤ K ≤ N ≤ 200000
  • 1pi10001 ≤ p_i ≤ 1000
  • All values in input are integers.

Input

Input is given from Standard Input in the following format:

NN KK p1p_1 ... pNp_N

Output

Print the maximum possible value of the expected value of the sum of the numbers shown.

Your output will be considered correct when its absolute or relative error from our answer is at most 10610^{-6}.


Sample Input 1

5 3
1 2 2 4 5

Sample Output 1

7.000000000000

When we throw the third, fourth, and fifth dice from the left, the expected value of the sum of the numbers shown is 77. This is the maximum value we can achieve.


Sample Input 2

4 1
6 6 6 6

Sample Output 2

3.500000000000

Regardless of which die we choose, the expected value of the number shown is 3.53.5.


Sample Input 3

10 4
17 13 13 12 15 20 10 13 17 11

Sample Output 3

32.000000000000