#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)
            for(j=1;j<=k;j++)
                if(v[ d[j] ]<minim)
                    minim = v[ d[j] ];
        if (minim > maxim ){
            ok=i;
            maxim=minim;
        minim=30000;
        }
    }

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

    return 0;
}