#include <fstream>
#include <deque>

using namespace std;
ifstream cin("secventa.in");
ofstream cout("secventa.out");

deque<int> que;
int v[500005],n,i,k,sol=-30001,poss=500001,posd=500001;
int main()
{
    cin>>n>>k;
    for(i=1;i<=n;i++)
        cin>>v[i];

    for(i=1;i<=n;i++)
    {
        if(i-que.front()==k)
            que.pop_front();

        while(!que.empty() && v[i]<v[que.back()])
            que.pop_back();

        que.push_back(i);

        if(i>=k)
        {
            if(sol<v[que.front()])
            {
                sol=v[que.front()];
                poss=que.front();
                posd=i;
            }
        }
    }
    cout<<posd-k+1<<" "<<posd<<" "<<sol;

    return 0;
}