#include <stdio.h>
int deque[500001],back,front,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);
    front=1;
    back=0;
    for (i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
        while (a[deque[back]]>=a[i] && back>=front) back--;
        deque[++back]=i;
        if (deque[front]==i-k) front++;
        if (i>=k && a[deque[front]]>max)
            {max=a[deque[front]]; y=i; x=i-k+1;}
    }
    printf("%d %d %d\n",x,y,max);
    return 0;
}