#include <bits/stdc++.h>

const int maxn = 1e5 + 5;
int n,k,a[maxn],sum[maxn],suf[maxn];

bool check(int x) {
	sum[0] = 0;
	for(int i = 1;i <= n;++ i)sum[i] = sum[i - 1] + (a[i] >= x ? 1 : -1);
	suf[n + 1] = -n;
	for(int i = n;i;-- i)suf[i] = std::max(suf[i + 1] , sum[i]);
	
	for(int i = 0;i <= n - k;++ i) {
		if(suf[i + k] - sum[i] > 0)return true;
	}
	return false;
}

int main() {
	freopen("player.in","r",stdin);
	freopen("player.out","w",stdout);
	scanf("%d %d",&n,&k);
	for(int i = 1;i <= n;++ i)scanf("%d",&a[i]);
	
	int l = 0,r = 5e5;
	while(l <= r) {
		int mid = (l + r) >> 1;
		if(check(mid))l = mid + 1;
		else r = mid - 1;
	}
	
	printf("%d",r);
	return 0;
}