#include <fstream>

using namespace std;

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

int n,k,i;
int D[500002],v[500002];
int maxim,p,u;
int poz;

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