Problem: The heat during the last few days has been really intense. Scientists from all over the Berland study how the temperatures and weather change, and they claim that this summer is abnormally hot. But any scientific claim sounds a lot more reasonable if there are some numbers involved, so they have decided to actually calculate some value which would represent how high the temperatures are.

Mathematicians of Berland State University came up with a special heat intensity value. This value is calculated as follows:

Suppose we want to analyze the segment of n consecutive days. We have measured the temperatures during these n days; the temperature during i-th day equals a_i.

We denote the average temperature of a segment of some consecutive days as the arithmetic mean of the temperature measures during this segment of days. So, if we want to analyze the average temperature from day x to day y, we calculate it as \frac{∑ _{i = x}^{y} a_i}{y - x + 1} (note that division is performed without any rounding). The heat intensity value is the maximum of average temperatures over all segments of not less than k consecutive days. For example, if analyzing the measures [3, 4, 1, 2] and k = 3, we are interested in segments [3, 4, 1], [4, 1, 2] and [3, 4, 1, 2] (we want to find the maximum value of average temperature over these segments).

You have been hired by Berland State University to write a program that would compute the heat intensity value of a given period of days. Are you up to this task?

Input

The first line contains two integers n and k (1 ≤ k ≤ n ≤ 5000) — the number of days in the given period, and the minimum number of days in a segment we consider when calculating heat intensity value, respectively.

The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 5000) — the temperature measures during given n days.

Output

Print one real number — the heat intensity value, i. e., the maximum of average temperatures over all segments of not less than k consecutive days.

Your answer will be considered correct if the following condition holds: |res - res_0| < 10^{-6}, where res is your answer, and res_0 is the answer given by the jury's solution.

Example

Input

4 3
3 4 1 2


Output

2.666666666666667

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;
public class Asd {
static PrintWriter w=new PrintWriter(System.out);
static FastScanner s=new FastScanner();
static HashSet<Long> list=new HashSet<>();
	public static void main(String[] args) {
		
		//int t=s.nextInt();
                int t=1;
		while(t-->0)
                {
		    solve();
		}
	       w.close();
        }
        /* Function to print all the permutations of the string
        static String swap(String str, int i, int j)
        {
        char ch;
        char[] array = str.toCharArray();
        ch = array[i];
        array[i] = array[j];
        array[j] = ch;
        return String.valueOf(array);
       }
    
      static void permute(String str,int low,int high)
    {
        if(low == high)
            list.add(Long.parseLong(str));
 
        int i;
        for(i = low; i<=high; i++){
            str = swap(str,low,i);
            permute(str, low+1,high);
            str = swap(str,low,i);
        }
    }
        use  permute(str2,0,str2.length()-1); to perform combinations
        */
           public static void solve()
        {
            int n=s.nextInt();
	int k=s.nextInt();
	int[] a=new int[n];
	double[] sum=new double[n];
	double max=Double.MIN_VALUE;
	a[0]=s.nextInt();
	sum[0]=a[0];
	for(int i=1;i<n;i++)
	{
		a[i]=s.nextInt();
		sum[i]=sum[i-1]+a[i];
    }
	for(int i=0;i<n-k+1;i++)
	{
		for(int j=i+k-1;j<n;j++) {
			if(i==0) {
				max=Math.max(max, sum[j]/(j+1));
			
				continue;
			}
				max=Math.max(max, (sum[j]-sum[i-1])/(j-i+1));
			
		}
		
	}
	w.println(max);
        }
           
        static void noofdivisors(int n)
        {
            //it counts no of divisors of every number upto number n
            
            int arr[]=new int[n+1];
              for(int i=1;i<=(n);i++)
			for(int j=i;j<=(n);j=j+i)
				arr[j]++;
        }
           
        
       
        static char[] reverse(char arr[])
        {
            char[] b = new char[arr.length]; 
        int j = arr.length; 
        for (int i = 0; i < arr.length; i++) { 
            b[j - 1] = arr[i]; 
            j = j - 1; 
        }
        return b;
        }
        
        
	static long factorial(int n)
        {
            long su=1;
            for(int i=1;i<=n;i++)
                su*=(long)i;
            return su;
        }
	static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		public String next() {
			while (!st.hasMoreElements())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}
		int[] readArray(int n) {
			int[] a=new int[n]; 
			for (int i=0; i<n; i++) a[i]=nextInt();
			return a;
		}
		
		int nextInt () {
			return Integer.parseInt(next());
		}
                long nextLong () {
			return Long.parseLong(next());
		}
                double nextDouble () {
			return Double.parseDouble(next());
		}
	}

}