#include <iostream>
#include <fstream>
#include <deque>
using namespace std;

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

void read(int* v, int n)
{
    for(int i = 0; i < n; i++)
        in >> v[i];
}

int main()
{
    int n, k; in >> n >> k;
    int v[n];
    read(v, n);

    deque<int> u;
    int maxBaza = -30001, index;
    u.push_back(v[0]);

    for(int i = 1; i < n; i++)
    {
        if(u.size() > 0 && u.front() == v[i-k])
                u.pop_front();

        if((v[i] < v[i+1] && i+1 < n) || (v[i] < u.back() && u.size() > 0) || u.size() == 0)
        {
            while(u.size() > 0 && v[i] < u.back())
                u.pop_back();
            u.push_back(v[i]);
        }

        if(i >= k-1)
            if(u.front() > maxBaza)
            {
                maxBaza = u.front();
                index = i;
            }
    }

    //cout << maxBaza << " " << index << endl;
    out << v[index-2] << " " << v[index-1] << " " << v[index] << endl;

    return 0;
}