#include<cstdio>
using namespace std;
int n,k,a[500001],deque[500001],front,back,sol=-30001,init,bestk;
int main()
{
    freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
scanf("%d %d ",&n,&k);
int ind, x;
front=1;back=0;

 {front=1;back=0;
        for(int j=1;j<=n;j++)
  { scanf("%d",&a[j]);
        while(front<=back && a[j]<a[deque[back]]) back--;
  deque[++back]=j;
  if(deque[front]==j-k) front++; 
  if(j>=k)if(sol<a[deque[front]]) {sol=a[deque[front]];init=j-k+1;bestk=k;}       
}       
         }
    
    printf("%d %d %d",init,init+bestk-1,sol);
    return 0;}