#include <iostream>
#include <fstream>
#include <stdio.h>
#include <deque>
using namespace std;
deque<int> D;
int n,k,m,A[500001];
long long Min=-0x3f3f3f3f;
int main()
{
    FILE* f=fopen("secventa.in","r");
    fscanf(f,"%d %d",&n,&k);
    for(int i=1;i<=n;i++)
    {
        fscanf(f,"%d ",&A[i]);
        while(!D.empty()&&A[i]<=A[D.back()])D.pop_back();
        D.push_back(i);
        if(D.front()==i-k)D.pop_front();
        if(i>=k&&A[D.front()]>Min)Min=A[D.front()],m=i;
    }
    fclose(f);
    freopen("secventa.out","w",f);
    fprintf(f,"%d %d %lld",m-k+1,m,Min);
    fclose(f);
    return 0;
}