#include <fstream>
using namespace std;

ifstream fin("secventa.in");
ofstream fout("secventa.out");

int n,k,i,j,minim,maxim,ok,v[500001],p,u,d[500001];


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

    p = 1;
    u = 0;

    for (i=1;i<=n;i++) {
        while (p<=u && v[i] <= v[ d[u] ])
            u--;

        d[++u] = i;

        if (i-d[p] == k)
            p++;
        if(i>=k)
            if (v[ d[p] ] > maxim ){
                maxim=v[d[p]];
                ok = i;
            }
    }

    fout<<ok-k+1<<" "<<ok<<" "<<maxim;

    return 0;
}