#include <fstream>
#include <deque>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
deque<int>c;
long long n,k,i,s,v[5000001],maxim;
int main()
{
    f>>n>>k;
    for(i=1;i<=n;i++)
        f>>v[i];
    c.push_back(1);
    for(i=2;i<=n;i++)
    {


        while(!c.empty()&&v[c.back()]>v[i])
        {
            if(c.size()==0)break;
               else c.pop_back();
        }
    c.push_back(i);
    if(c.back()-c.front()>=k){c.pop_front();}
    if(i>=k)
    {
        if (v[c.front()]>maxim)
        {
            maxim=v[c.front()];
        }
    }
    }
    g<<maxim;
    return 0;
}