#include <cstdio>
#include <cstdlib>
#define MX 500001
#define maxim(a,b) ((a>b) ? a : b)
//using namespace std;

FILE *fin, *fout;
int n,k;
int s[MX], a[MX],m=-32000,start;
long fsize,poz;
char *buffer;

void citire()
{
    fin = fopen("secventa.in", "r");
    fout = fopen("secventa.out", "w");

    fseek(fin, 0, SEEK_END);
    fsize = ftell(fin);
    rewind(fin);

    buffer = (char*) malloc(fsize);
    fsize = fread(buffer, 1, fsize, fin);
}

int numar()
{
    int nr=0,semn;
    while((buffer[poz]<'0' || buffer[poz]>'9') && buffer[poz]!='-') poz++;

    //printf("%d ", poz);

    if(buffer[poz] == '-')
    {
        semn = -1;
        poz++;
    }
    else semn = 1;

    //printf("%d ", poz);

    while(buffer[poz]>='0' && buffer[poz]<='9')
    {
        nr = nr*10 + buffer[poz] - '0';
        poz++;
    }

    //printf("%d\n", poz);

    return (nr*semn);
}

int main()
{
    int i;
    int l,d;
    l=1;
    d=0;
    citire();
    n = numar();
    k = numar();

    for(i=1; i<=n; i++)
    {
        a[i] = numar();
        //fprintf(fout, "%d ", a[i]);

        while(l<=d && a[i]<=a[s[d]]) d--;

        s[++d] = i;

        if(s[l] == i-k) l++;

        if(a[s[l]] > m && i>=k)
        {
            m = a[s[l]];
            start = maxim(1, i-k+1);
        }
    }

    fprintf(fout, "%d %d %d", start, start+k-1, m);
    free(buffer);

    fclose(fin); fclose(fout);
    return 0;
}