#include <fstream>

using namespace std;

ifstream fin("secventa.in");
ofstream fout("secventa.out");

int N , K , bk ,fr;
short A[500001] , dq[500001] ,bmax = -30005;

int main()
{
	fin>>N>>K;
	fr = 1; bk = 0;
	for(int i = 1;i<=N;++i)
	{
		fin>>A[i]; 
		while(fr<=bk && A[i] <= A[dq[bk]]) bk--;
		dq[++bk] = i;
		if(dq[fr] == i - K) fr++;
		if(i>=K) bmax = max(bmax,A[dq[fr]]);
	}
	fout<<bmax<<'\n';
	return 0;
}