#include <fstream>
#include <deque>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
deque<int> dq;
int n,i,k,maxim=-2000000005,st,dr,v[500005];
int main()
{
    fin>>n>>k;
    for(i=1;i<=n;i++)
    {
        fin>>v[i];
        while(!dq.empty() && v[dq.back()]>=v[i])
            dq.pop_back();
        dq.push_back(i);
        if(dq.front()==i-k)
            dq.pop_front();
        if(i>=k && v[dq.front()]>maxim)
        {
            maxim=v[dq.front()];
            st=i-k+1;
            dr=i;
        }
    }
    fout<<st<<" "<<dr<<" "<<maxim;
    return 0;
}