#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int a[500001],deq[500001],k,n;
int minim=-30001,p1,p2;
int main()
{
    f>>n>>k;
    int i,prim=1,ultim=0;
    for(i=1;i<=n;i++)
    {
        f>>a[i];
        while(a[i]<=a[deq[ultim]] && prim<=ultim)
                ultim--;
        ultim++;
        deq[ultim]=i;
        if(deq[prim]==i-k)
                prim++;
         if(i>=k && minim<a[deq[prim]])
        {
            p1=deq[prim];
            minim=a[deq[prim]];

        }
    }
    g<<p1<<" "<<p1+k-1<<" "<<minim;

    return 0;
}