Submit solution

Points:
15 (partial)

Time limit:
0.6s

Memory limit:
64M

Author:

Problem type

Allowed languages

Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, ~~CommonLisp~~, D, Dart, F#, Forth, Fortran, Go, ~~Groovy~~, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, ~~Nim~~, ~~ObjC~~, OCaml, ~~Octave~~, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

You are given an array of integers. Find a consecutive subsequence of numbers of the length at least that has the maximal possible average.

**Please note:** the average of a subsequence is the sum of all the numbers in the subsequence divided by its length.

#### Input

The first line of input contains two integers and . The second line of input contains integers

#### Output

The first and only line of output must contain the maximal possible average. An absolute deviation of from the official solution is permitted.

#### Scoring

In test cases worth 30% of total points, it will hold that is not larger than .

#### Sample Input 1

```
4 1
1 2 3 4
```

#### Sample Output 1

`4.000000`

#### Sample Input 2

```
4 2
2 4 3 4
```

#### Sample Output 2

`3.666666`

#### Sample Input 3

```
6 3
7 1 2 1 3 6
```

#### Sample Output 3

`3.333333`

## Comments

Please notice that it is expected to output finite number of digits after the decimal.