PROGRAMMING:Maximum mean subsequence of at least l length
Given a positive integer sequence a of length n. Find a subsequence with maximum average and length not less than L..
###Input format:
The first line, n (n < = 100000) and l; The second line contains n positive integers, representing a.
###Output format:
An integer representing 1000 times the answer (output directly without rounding).
###Input example:
```in
10 6
6 4 2 10 3 8 5 9 4 7
```
###Output example:
The corresponding output is given here. For example:
```out
six thousand five hundred and seventy-one
```
answer：If there is no answer, please comment
###Input format:
The first line, n (n < = 100000) and l; The second line contains n positive integers, representing a.
###Output format:
An integer representing 1000 times the answer (output directly without rounding).
###Input example:
```in
10 6
6 4 2 10 3 8 5 9 4 7
```
###Output example:
The corresponding output is given here. For example:
```out
six thousand five hundred and seventy-one
```
answer：If there is no answer, please comment