#include <cstdio>

#include <climits>

using namespace std;

FILE *f, *g;

int n, k;

int st, dr;

int mx = INT_MIN, start, en;

int d[500001];

int v[500001];

void stanga(int i)
{
    if (i - k + 1 == d[st])
        st++;
}

void dreapta(int i)
{
    while (st <= dr && v[i] < v[d[dr]])
        dr --;

    d[++ dr] = i;
}

void solve()
{
    int i, nr;

    f = fopen("secventa.in", "r");

    fscanf(f, "%d%d", &n, &k);

    for(i = 1; i <= n; i ++)
    {
        fscanf(f, "%d", &nr);

        v[i] = nr;

        dreapta(i);

        if(i >= k)
        {
            if(v[d[st]] > mx)
                mx = v[d[st]], start = i + 1 - k + 1, en = i + 1;

            stanga(i);
        }
    }
}

void printFile()
{
    g = fopen("secventa.out", "w");

    fprintf(g, "%d %d %d\n", start, en, mx);

    fclose(g);
}

int main()
{
    solve();

    printFile();

    return 0;
}