#include <fstream>

using namespace std;

int n,i,v[500001],k,p,j,u,maxim,x,p1,p2,k2,d[500001];

ifstream fin ("secventa.in");

ofstream fout ("secventa.out");

int main (){

    fin>>n>>k;
    for (i=1;i<=n;i++)
        fin>>v[i];

    p = 1;
    u = 1;
    d[1] = 1;
    for (i=2;i<=n;i++){
        while (p<=u && v[i] <= v[d[u]])
            u--;
        d[++u] = i;
        if (i-d[p] == k)
            p++;
        if (i>=k && v[d[p]] > maxim){
            maxim = v[d[p]];
            p1 = i-k+1;
            p2 = i;
        }

    }
    fout<<p1<<" "<<p2<<" "<<maxim;

    return 0;
}