#include <fstream>

using namespace std;

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

int n, k, v[500004], d[500004], p, u, maxim  = -1;

int main()
{
    fin>>n>>k;
    for(int i = 1; i <= n; i++){
        fin>>v[i];
    }
    d[1] = 1; p = 1; u = 1;
    for(int i = 2; i <= n; i++){
        while (p <= u && v[i] < v[d[u]]){
            u--;
        }
        u++;
        d[u] = i;
        if(i - d[p] == k){
            p++;
        }
        if(i >= k){
            if(maxim < v[d[p]]){
                maxim = v[d[p]];
            }
        }
    }
    fout<<maxim;
    return 0;
}