#include <fstream>
#include <deque>
using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
int i,j,k,v[500001],n,maxim,x,y;
deque<int> dq;
int main()
{
    in>>n>>k;
    for(i=1; i<=n; i++)
        in>>v[i];
    for(i=1; i<=n; i++)
    {
        if(!dq.empty() && dq.front()+k == i )
            dq.pop_front();
        while(!dq.empty() && v[dq.back()]>=v[i])
             dq.pop_back();
        dq.push_back(i);
        if(i>=k)
        {
            if(v[dq.front()]>maxim)
            {
                maxim=v[dq.front()];
                x=i-k+1; y=i;
            }
        }
    }
    out<<x<<" "<<y<<" "<<maxim;
}