#include<stdio.h>
int a[200001],n,k,i,j,min,max=-32767,x;
int minim(int p,int u)
{if(p==u) return p;
 int m=(p+u)/2;
 int c=minim(p,m);
 int b=minim(m+1,u);
 return (a[c]<a[b])?c:b;
}
int main(){
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
scanf("%d %d",&n,&k);
for(i=1;i<=n;i++)
{scanf("%d",&a[i]);
 if(i>=k){min=minim(i-k+1,i);
  if(a[min]>max) {x=i;max=a[min];}}}
printf("%d %d %d",x-k+1,x,max);
fclose(stdout);
return 0;}