#include <iostream>
#include <cstdio>
using namespace std;
FILE *f=fopen ("secventa.in","r");
FILE *g=fopen ("secventa.out","w");

int b[5000010],a[5000010],n,ma,pozi,pozf,maxx=-31000;
long long sum=0;
void Solve()
{

    int k=0,ls=0,i;
    int j=0;
    for (i=1;i<=n;i++)
    {

    while (k>0 && a[i]<a[b[k]] && k>=j) k--;
    k++;
    b[k]=i;
    while (b[j]<i-ma+1 && j<=k) j++;
    if (i-ma+1>=1 && a[b[j]]>maxx) {pozi=b[j];pozf=i;maxx=a[b[j]];}


    }


 }


int main()
{
    int i;
fscanf(f,"%d %d",&n,&ma);
for (i=1;i<=n;i++)
{
    fscanf (f,"%d",&a[i]);
}
Solve();
fprintf (g,"%d %d %d",pozi,pozf,maxx);


    return 0;
}