#include<cstdio>
#include<deque>
std::deque<int> coada;
int V[500007];
int main()
{
 freopen("secventa.in","r",stdin);
 freopen("secventa.out","w",stdout);
 int n,k,max=-30001,rasp;
 scanf("%d %d ",&n,&k);
 for(int i=1;i<=n;i++)
     {
      scanf("%d ",&V[i]);
     }
 for(int i=1;i<=n;i++)
     {
      while(!coada.empty() && i-coada.front()>=k)
            coada.pop_front();
      while(!coada.empty() && V[coada.back()]>V[i])
            coada.pop_back();
      coada.push_back(i);
      if(i>=k)
         {
          if(V[coada.front()]>max)
             {
              max=V[coada.front()];
              rasp=i;
             }
         }
     }
 printf("%d %d %d ",rasp-k+1,rasp,max);
 fclose(stdin);
 fclose(stdout);
return 0;
}