#include <stdio.h>
struct blabla{int x;int y;};
blabla deque[1000000];
long max,s,n,k,p,capat,coada,a[1000000],i,P;
void in(long v,long p)
{
   while(capat<=coada&&v<deque[coada].x)coada--;
   coada++;deque[coada].x=v;deque[coada].y=p;
}
int query()
{
     while(capat<=coada&&deque[capat].y<P)capat++;
     return deque[capat].x;
}
int main()
{
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    scanf("%ld %ld\n",&n,&k);
    for(i=1;i<k;i++)
    scanf("%ld ",&a[i]);
    capat=1;max=-125000000;
    for(i=1;i<k;i++)in(a[i],i);
    for(i=k,P=1;i<=n;i++,P++)
    {
       in(a[i],i);
       if(query()>max)max=query();s=i;
    }
    printf("%ld %ld %ld",s-k+1,s,max);
    
    return 0;
}