#include <fstream>
#include <deque>

using namespace std;

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

int n, k, i;
int v[500001];
int rez = -2000000000;
int st, dr;

deque < int > coada;

int main()
{
    f >> n >> k;

    for (i=1; i<=n; i++)
    {
        f >> v[i];
        while (!coada.empty() && v[i] <= v[coada.back()])
            coada.pop_back();
        coada.push_back(i);

        if (coada.front() == i-k)
            coada.pop_front();

        if (v[coada.front()] > rez)
        {
            rez = v[coada.front()];
            st = coada.front();
            dr = coada.back();
        }

    }

    g << st << " " << dr << " " << rez;

    return 0;
}