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
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.InputMismatchException;
import java.util.Scanner;
import java.util.StringTokenizer;
/*
 * 
 * daiict
 *
 * 
 * 
 */

public class pprac
{
	FastScanner in;
	PrintWriter out;

	static int countc = 0;
	static int minm = countc;

	static ArrayList[] adj;
	static ArrayList[] aadj;
	static int last;
	static int n;
	static int m;

	static int[] dp1;
	static int[] dp2;
	static int color[];
	static int visited[];
	static int[] arr;
	static long[] brr;
	static double ans;
	static int array[];
	static int start[];
	static int finish[];
	static int pref[];
	static int tree[];
	static int maxval = 32;

	static int ttt[];
	static int sum = 0;
	static String s;

	static int cc = 0;
	static long min = Long.MAX_VALUE;

	static ArrayList<Integer> segt[];

	// for dfs do not delete
	static int dir[][] =
	{
			{ 1, 0 },
			{ 0, 1 },
			{ 0, -1 },
			{ -1, 0 } };

	static int[] seg;
	static long count = 1;
	static long mod = (long) 1e9 + 7;

	static int parent[];
	static int size[];

	static int[] l;
	static int[] r;
	static int[] next;
	static int[] cnt;
	static int[] block;

	static int bblock = 1001;

	static HashSet<String> set;
	static HashSet<String> set2;

	static int low[];
	static int disc[];
	static int time;
	static int acn[];

	static HashMap<Long, Integer> map;

	static class Pair implements Comparable<Pair>
	{
		int x;
		int y;
		int i;

		Pair(int l, int m, int i)
		{

			this.x = l;
			this.y = m;
			this.i = i;

		}

		public int compareTo(Pair p)
		{

			if (this.x / bblock == p.x / bblock)
			{
				return (int) (this.y - p.y);
			}
			return (int) (this.x / bblock - p.x / bblock);
		}

		public String toString()
		{
			return x + " " + y;
		}

		public boolean equals(Object o)
		{
			if (o instanceof Pair)
			{
				Pair a = (Pair) o;

				return this.x == a.x;
			}

			return false;
		}

		public int hashCode()
		{
			return new Long(x).hashCode() * 31 + new Long(y).hashCode();
		}

	}

	public static int gcd(int a, int b)
	{
		if (b == 0)
			return a;
		return gcd(b, a % b);
	}

	void build(int n)
	{ // build the tree
		for (int i = n - 1; i > 0; --i)
			seg[i] = Math.min(seg[i << 1], seg[i << 1 | 1]);
	}

	public static void modify(int p, int val, int n)
	{ // set value at position
		// p
		for (seg[p += n] = val; p > 1; p >>= 1)
			seg[p >> 1] = Math.min(seg[p], seg[p ^ 1]);
	}

	int query(int l, int r, int n)
	{ // sum on interval [l, r)
		int res = Integer.MAX_VALUE;

		if (l > r)
		{
			return res;
		}

		for (l += n, r += n; l < r; l >>= 1, r >>= 1)
		{
			if ((l & 1) == 1)
				res = Math.min(res, seg[l++]);
			if ((r & 1) == 1)
				res = Math.min(res, seg[--r]);
		}
		return res;
	}

	// public static void update(int x,int val){
	// while(x<=maxval){
	// tree[x] += val;
	// x = (x&-x);
	// }
	// }

	public static int read(int idx)
	{
		int sum = 0;

		while (idx >= 0)
		{
			sum += tree[idx];
			idx -= (idx & (-idx));
		}

		return sum;
	}

	public static int find(int i)
	{
		if (parent[i] != i)
		{
			return find(parent[i]);
		}

		return i;
	}

	public static void union(int a, int b)
	{
		int x = find(a);
		int y = find(b);

		if (x != y)
		{
			if (size[x] > size[y])
			{
				size[x] += size[y];
				parent[y] = x;
			} else
			{
				size[y] += size[x];
				parent[x] = y;
			}
		}
	}

			/* static */ void solve()
	{
		Scanner in = new Scanner(System.in);

		int n = in.nextInt();
		int k = in.nextInt();

		double arr[] = new double[n];

		for (int i = 0; i < n; i++)
		{
			arr[i] = in.nextDouble();
		}

		double p[] = new double[n];
		p[0] = arr[0];

		for (int i = 1; i < n; i++)
		{
			p[i] = p[i - 1] + arr[i];
		}

		double max = 0.0;

		for (int i = k - 1; i < n; i++)
		{
			double temp = p[i] / (double) (i + 1);
			for (int j = 0; j <= i - k; j++)
			{
				temp = Math.max(temp, (p[i] - p[j]) / (double) (i - j));
			}
			max = Math.max(max, temp);
		}

		out.println(max);

	}

	public static int ceil(int[] a, int left, int right, int value)
	{
		int low = left;
		int high = right;
		while (low != high)
		{
			// System.out.println(low + " " + high);
			int mid = (low + high) / 2;
			if (a[mid] < value)
			{
				low = mid + 1;
			} else
			{
				high = mid;
			}
		}
		if (low == right)
		{
			return -1;
		}
		return low;
	}

	public static int floor(int[] a, int left, int right, int value)
	{
		while (left != right)
		{
			int mid = (left + right) >> 1;
			if (a[mid] <= value)
			{
				left = mid + 1;
			} else
			{
				right = mid;
			}
		}
		if (left < 0)
		{
			left *= -1;
		}
		return --left;
	}

	public static HashSet<Integer> call(int a)
	{

		HashSet<Integer> list = new HashSet();

		while (a % 2 == 0)
		{
			list.add(2);
			a /= 2;
		}
		int n = a;
		for (int i = 3; i <= n; i += 2)
		{
			while (a % i == 0)
			{
				list.add(i);
				a = a / i;
			}
		}

		if (a > 2)
		{
			list.add(a);
		}

		return list;
	}

	public static String reverse(String s)
	{

		String ans = "";

		for (int i = s.length() - 1; i >= 0; i--)
		{
			ans += s.charAt(i);
		}

		return ans;

	}

	public static long sum(long x)
	{
		return x < 10 ? x : x % 10 + sum(x / 10);
	}

	public static long gcd(long x, long y)
	{
		if (x == 0)
			return y;
		else
			return gcd(y % x, x);
	}

	static long inv(long x, long mod)
	{
		long r, y;
		for (r = 1, y = mod - 2; y != 0; x = x * x % mod, y >>= 1)
		{
			if ((y & 1) == 1)
				r = r * x % mod;

		}
		return r;
	}

	public static long pow(long x, long y, long n)
	{
		if (y == 0)
			return 1 % n;
		if (y % 2 == 0)
		{
			long z = pow(x, y / 2, n);
			return (z * z) % n;
		}
		return ((x % n) * pow(x, y - 1, n)) % n;
	}

	public static boolean isPrime(long a)
	{
		// Corner cases
		if (a <= 1)
			return false;
		if (a <= 3)
			return true;

		// This is checked so that we can skip
		// middle five numbers in below loop
		if (a % 2 == 0 || a % 3 == 0)
			return false;

		for (long i = 5; i * i <= a; i = i + 6)
			if (a % i == 0 || a % (i + 2) == 0)
				return false;

		return true;
	}

	void run() throws NumberFormatException, InputMismatchException, IOException
	{
		in = new FastScanner();
		out = new PrintWriter(System.out);

		solve();

		out.close();
	}

	class FastScanner
	{
		BufferedReader br;
		StringTokenizer st;

		public FastScanner()
		{
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next()
		{
			while (st == null || !st.hasMoreTokens())
			{
				try
				{
					st = new StringTokenizer(in.br.readLine());
				} catch (IOException e)
				{
					// TODO Auto-generated catch block
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt()
		{
			return Integer.parseInt(next());
		}

		long nextLong()
		{
			return Long.parseLong(next());
		}

		double nextDouble()
		{
			return Double.parseDouble(next());
		}
	}

	public static void main(String[] args) throws NumberFormatException, InputMismatchException, IOException
	{
		// new Thread(null ,new Runnable(){
		// public void run(){
		// try{
		//
		// test();
		//
		// } catch(Exception e){
		// e.printStackTrace();
		// }
		// }
		// },"1",1<<26).start();
		// }
		// static StringBuilder sb;
		// public static void test() throws IOException{
		// sb=new StringBuilder();
		// int t=1;
		// while(t-->0){
		//
		// solve();
		//
		// }
		//

		new pprac().run();
	}

}

class Node
{
	int a;
	int b;

	public Node(int i, int j)
	{
		this.a = i;
		this.b = j;

	}

}

class MyComp implements Comparator<String>
{

	int c = 0;

	MyComp(int d)
	{
		c = d;
	}

	@Override
	public int compare(String a, String b)
	{

		// < == -1

		String arr[] = a.split(" ");
		String brr[] = b.split(" ");

		return arr[c].compareTo(brr[c]);

	}

}

class MyComp2 implements Comparator<Node>
{

	@Override
	public int compare(Node a, Node b)
	{

		// < == -1

		if (a.b > b.b)
		{
			return -1;
		} else
		{
			return 1;
		}

	}

}