#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream ka("secventa.in");
ofstream ki("secventa.out");
struct element
{
    int el, indice;
};
deque <element> coada;
int x, n, k, maxim = -100000, inc = 1, sf = 1;
int main()
{
    ka >> n >> k;
    for(int i = 1; i <= n; i++)
    {
        ka >> x;
        if(!coada.empty())
        {
            while(coada.back().el > x)
            {
                coada.pop_back();
            }
            if(i - coada.front().indice + 1 > k)
                coada.pop_front();
        }
        element elo;
        elo.el = x;
        elo.indice = i;
        coada.push_back(elo);
        if(!coada.empty())
        cout << coada.front().el;
    }
    ki << inc << " " << sf << " " << maxim;
}