#include <cstdio>
#define maxn 500001

FILE *in = fopen("secventa.in","r"), *out = fopen("secventa.out","w");

int n;
int k;
int a[maxn] = {0};

void read()
{
    fscanf(in, "%d %d", &n, &k);

    for ( int i = 1; i <= n; ++i )
        fscanf(in, "%d", &a[i]);
}

struct deque
{
    int poz, v;
};

deque Q[maxn];

/*
8 3
-1 2 3 1 0 4 8 6

poz[i] = pozitia elementul i din Q in a
Q:          poz         v

            5           0
            6           4
            8           6

*/

int main()
{
    read();

    int first = 1, last = 1;
    Q[first].v = a[1];
    Q[first].poz = 1;

    int min = -300000000;
    int pmin = 0;

    for ( int i = 2; i <= n; ++i )
    {
        while ( first <= last && i - Q[first].poz >= k  )
            ++first;
        while ( last >= first && Q[last].v >= a[i] )
            --last;

        if ( Q[first].v > min )
            min = Q[first].v, pmin = Q[first].poz;

        Q[++last].v = a[i];
        Q[last].poz = i;
    }

//    printf("%d %d\n\n", first, last);
    fprintf(out, "%d %d %d\n", pmin, pmin + k - 1, min);

//    int min = 100000000;
//    int start = 0, stop = 0;
//    for ( int i = 1; i <= last; ++i )
//        if ( Q[i].v < min )
//            min = Q[i].v, start = Q[i].poz, stop = Q[i].poz + k - 1;
//
//    for ( int i = 1; i <= n; ++i )
//        printf("%d %d\n", Q[i].v, Q[i].poz);
//
//    printf("\n");
//
//    fprintf(stdout, "%d %d %d\n", start, stop, min);

	return 0;
}