#include <iostream>
#include <fstream>
#include <deque>
/**L9 GANG LEADER
WHEN THE IMPOSTOR IS SUS?????? SOLOBOLO
*/
using namespace std;
string files="secventa";
ifstream in(files+".in");
ofstream out(files+".out");
deque<int> dq;
int v[500007];
int main()
{
    int n,k;
    in>>n>>k;
    int x;
    int maxmin=-100000;
    int p1,p2;
    for(int i=1;i<=n;i++)
    {
        in>>v[i];
        while(!dq.empty()&&v[dq.back()]>=v[i])
            dq.pop_back();
        dq.push_back(i);
        if(i-dq.front()==k)
            dq.pop_front();
        if(i>=k)
        {
            if(maxmin<v[dq.front()])
            {
                maxmin=v[dq.front()];
                p2=i;
                p1=i-k+1;
            }
        }
    }
    out<<p1<<' '<<p2<<' '<<maxmin;
    return 0;
}