#include <fstream>
#include <deque>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int Front,Back,Deque[500001],v[500001],i,k,n,Max=-30001,incep,termin;
int main()
{
    fin>>n>>k;
    for(i=1;i<=n;i++)
        fin>>v[i];
        Front=1;Back=0;
    for(i=1;i<=n;i++)
    {
        while(Front<=Back && v[i]<=v[Deque[Back]])
            Back--;
        Deque[++Back]=i;
        if(Deque[Front]==i-k)
            Front++;
        if(i>=k)
            if(v[Deque[Front]]>Max)
            {Max=v[Deque[Front]];incep=i-k+1;termin=i;}
    }
    fout<<incep<<" "<<termin<<" "<<Max;
}