#include <cstdio>
#include <deque>

#define INF 0x3f3f3f3f
#define maxN 500000

using namespace std;

int v[maxN+1];
deque <int> d;

int main(){
    FILE *fin, *fout;
    fin=fopen("secventa.in", "r");
    fout=fopen("secventa.out", "w");
    int N, K, i, bmax, left, right;
    fscanf(fin, "%d%d", &N, &K);
    for (i=1; i<=N; i++)
        fscanf(fin, "%d", &v[i]);
    bmax=-INF;
    for (i=1; i<=N; i++){
        if (d.front()==i-K)
            d.pop_front();
        while (!d.empty() && v[i]<=v[d.back()])
            d.pop_back();
        d.push_back(i);
        if (i>=K && v[d.front()]>bmax){
            bmax=v[d.front()];
            left=i-K+1;
            right=i;
        }
    }
    fprintf(fout, "%d %d %d\n", left, right, bmax);
    fclose(fin);
    fclose(fout);
    return 0;
}