#include <cstdio>
#include <deque>
using namespace std;
deque <int>dq;
int i,n,a[500003],Max,poz1,poz2,k;
int main()
{freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
scanf("%d %d",&n,&k);Max=-99999999;
for(i=1;i<=n;i++)
    scanf("%d",&a[i]);
    dq.push_back(1);
    for(i=2;i<=n;i++){
    while(!dq.empty() && a[i]<=a[dq.back()])
    dq.pop_back();
    dq.push_back(i);
    if(i-dq.front()>=k)dq.pop_front();
    if(i>=k && a[dq.front()]>Max){
    Max=a[dq.front()];
    poz1=i-k+1;
    poz2=i;
    }
    }
    printf("%d %d %d",poz1,poz2,Max);

    return 0;
}