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