#include <iostream>
#include <fstream>
using namespace std;
ifstream in("deque.in");
ofstream out("deque.out");
int d[1000001];
int main()
{
    int k,n;
    int mnf=-100000000;
    int pi=1,ps=1;
    int mnsecv=-100000000;
    in>>n>>k;
    for(int i=1;i<=n;i++)
    {
        int x;
        in>>x;
        ps++;
        d[ps]=x;
        mnsecv=d[pi];
        mnf=max(mnf,mnsecv);
        if(ps-pi>k)
            pi++;
        while(d[ps]>d[ps-1] && ps>=pi)
        {
            d[ps-1]=d[ps];
            ps--;
        }
    }
    out<<mnf;
    return 0;
}