A Gujarati Businessman wants to grow his business. He has an array of integers,

Arr each element describing his sales on a particular day. He wants to show maximum sales to his customer so he choses two days,

L and

R, such that the average sales from

L to

R (both inclusive) is maximum. Due to certain reasons he wants atleast

K days included for taking average.

Given the array, determine maximum value of

such that

R-L+1>=K.

Input Format :
First line of input contains integer

T, the number of test cases.

First line of every test case contains integers

N and

K, the size of array and minimum days respectively.

Next line contains

N elements,depicting sales on the

N days.

Output Format :
If x is the answer to the problem print

floor( x*10000) for each test case.

Constraints :
1 ≤

T ≤ 5

1 ≤

N ≤ 100000

1 ≤

K ≤ 100

K ≤

N
0 ≤

Arr_{i} ≤ 100000

Sample Input :
1

5 3

15 2 4 6 9

Sample Output :
72000

Explanation :
Considering all elements (15+2+4+6+9)/5=7.2

floor(7.2*10000) = 72000