#include <fstream>

using namespace std;

ifstream f("secventa.in");
ofstream g("secventa.out");
int front=1,back=1,d[500001],v[500001],n,k,minim,pi,pf;
int main()
{
    f>>n>>k;
    for(int i=1;i<=n;i++)
        f>>v[i];
    for(int i=1;i<=n;i++)
    {
        while(front <= back && v[d[back]]>=v[i])
            back--;
        d[++back]=i;
        if(i-k == d[front])
            front++;
        if(i>=k)
            if(minim<d[front])
            {
                minim=v[d[front]];
                pi=d[front];
                pf=d[front]+(k-1);
            }
    }
    g<<pi<<" "<<pf<<" "<<minim;
}