PROGRAMMING:The average of subsequences
Given a nonnegative sequence $$a $$of length $$n $$, please find a sub segment of length no less than $$l $$(the sub segment is a set of continuous elements in sequence a), so that the average value in the sub segment is the largest. The final output is the maximum average.
###Input format:
Two integers in the first line $$n, l (1 < = l < = n < = 100000)$$
The following $$n $$lines, each with a non negative integer, represent the value of each element in the sequence $$a $.
###Output format:
An integer, * * the result of multiplying the maximum average value you want by 1000 (note not to round, output directly) * *.
###Input example:
```in
10 6
six
four
two
ten
three
eight
five
nine
four
one
```
###Output example:
```out
six thousand and five hundred
```
answer：If there is no answer, please comment
###Input format:
Two integers in the first line $$n, l (1 < = l < = n < = 100000)$$
The following $$n $$lines, each with a non negative integer, represent the value of each element in the sequence $$a $.
###Output format:
An integer, * * the result of multiplying the maximum average value you want by 1000 (note not to round, output directly) * *.
###Input example:
```in
10 6
six
four
two
ten
three
eight
five
nine
four
one
```
###Output example:
```out
six thousand and five hundred
```
answer：If there is no answer, please comment