#include <stdio.h>
int q[500001],b,f,i,a[500001],k,n;
int max=-31001,x,y;
int main(void)
{
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    scanf("%d%d",&n,&k);
    f=1;
    b=0;
    for (i=1;i<=n;i++)
    {
        scanf("%d",&a[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; x=i-k+1;}
    }
    printf("%d %d %d\n",x,y,max);
    return 0;
}