#include <fstream>
#include <deque>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
deque<int>c;
short int n,k,i,s,v[500001],maxim=-32000,psm,pf,ps;
int main()
{
    f>>n>>k;
    for(i=1;i<=n;i++)
        f>>v[i];
    c.push_back(1);ps=1;
    for(i=2;i<=n;i++)
    {


        while(!c.empty()&&v[c.back()]>v[i])
        {
            c.pop_back();
        }
    c.push_back(i);
    if(c.back()-c.front()==k){c.pop_front();}
    if(i>=k&&v[c.front()]>maxim)
    {
        maxim=v[c.front()];
        psm=i-k+1;
        pf=i;
    }
    }
    g<<psm<<" "<<pf<<" "<<maxim;
    return 0;
}