#include<stdio.h>

int n,k,bmax,pr=1,dp=0,du=0,v[500003],d[500003];

void add_deque(int id) {
  while((du>=dp)&&(v[d[du]]>=v[id])) du--;
  d[++du]=id;
}

int main() {
  int i;
  freopen("secventa.in","r",stdin);
  freopen("secventa.out","w",stdout);
  scanf("%d %d",&n,&k);
  for(i=1;i<=n;i++) scanf("%d",v+i);
  for(i=1;i<=k;i++) add_deque(i);
  bmax=v[d[dp]];
  for(i=k+1;i<=n;i++) {
    if(d[dp]==i-k) dp++;
    add_deque(i);
    if(v[d[dp]]>bmax) {
      bmax=v[d[dp]];
      pr=i-k+1;
    }
  }
  printf("%d %d %d",pr,pr+k-1,bmax);
  return 0;
}