#include <bits/stdc++.h>

using namespace std;

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

int n, k, x, maxim = -30007, xx, y;
deque <pair <int, int> > coada;
int main()
{
    fin >> n >> k;
    for (int i = 1; i <= n; ++i)
    {
        fin >> x;
        while (coada.size() > 0 && x <= coada.back().second)
            coada.pop_back();
        coada.push_back({i, x});
        if (coada.front().first == i - k)
            coada.pop_front();
        if (i >= k)
            if (coada.front().second > maxim)
            {
                maxim = coada.front().second;
                xx = i - k + 1;
                y = i;
            }
    }
    fout << xx << " " << y << " " << maxim;
    fin.close();
    fout.close();
    return 0;
}