#include <bits/stdc++.h>

using namespace std;
ifstream fin("deque.in");
ifstream fout("deque.out");
int u,p,n,i,v[5000005],m[5000005],p,u;
long long sum;
int main()
{
    fin>>n>>k;
    d[1]=1;
    p=u=1;
    for (i=1;i<=n;i++)
        fin>>v[i];
    for (i=2;i<=n;i++)
        {
            while (p<=u && v[i]<=v[m[u]])
                u--;
            d[++u]=i;
            if (i-d[p]==k) p++;
            if (i>=k) sum=+v[m[p]];
        }
    fout<<sum;
    return 0;
}