#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

int n, k;
string a;

double d[1000000], s[1000001];
bool f(double v) {
	inc(i, n) {
		d[n + i] = d[i] = 1.0 * (a[i] - '0') - v;
	}
	
	s[0] = 0;
	inc(i, n * 2) {
		s[i + 1] = s[i] + d[i];
	}
	
	map<double, int> mp;
	incID(i, k, 2 * n) {
		mp[s[i - k]]++;
		if((mp.begin() -> FI) <= s[i]) { return true; }
		if(n < i) {
			double ss = s[i - n];
			mp[ss]--;
			if(mp[ss] == 0) { mp.erase(ss); }
		}
	}
	return false;
}

int main() {
	cin >> n >> k >> a;
	
	a += a;
	
	double L = 0.0, H = 1.0;
	inc(i, 20) { // test
		double M = (L + H) / 2.0;
		(f(M) ? L : H) = M;
	}
	
	printf("%.8f\n", H);
	
	return 0;
}