#include <fstream>
using namespace std;
int q[500001],a[500001],k,n;
int main(void)
{
    int b,f,i,max=-31001,x,y;
    ifstream in("secventa.in");
    ofstream out("secventa.out");
    in>>n>>k;
    for (i=1;i<=n;i++)
        in>>a[i];
    f=1;
    b=0;
    for (i=1;i<=n;i++)
    {
        while (a[q[b]]>=a[i] && b>=f) b--;
        q[++b]=i;
        if (q[f]==i-k) f++;
        if (i>=k && a[q[f]]>max)
            {max=a[q[f]]; y=i; }
    }
    out<<y-k+1<<" "<<y<<" "<<max<<"\n";
    return 0;
}