#include<fstream>
#include<queue>
using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
deque <int> d;
int k;
long long s ;
int  n , v[5000001];
int maxim=-32000,pmax;
void dreapta(int p)
{
    while(!d.empty() && v[p]<=v[d.back()])
    {
        d.pop_back();
    }
    d.push_back(p);
}
void stanga(int p)
{
    if(d.front()==p-k)
        d.pop_front();
}
int main()
{
    in>>n>>k;
    for(int i=1;i<k;i++)
    {
        in>>v[i];
        stanga(i);
        dreapta(i);

    }
    for(int i=k;i<=n;i++)
    {
        in>>v[i];
        stanga(i);
        dreapta(i);
        if(v[d.front()]>maxim)
        {
            maxim=v[d.front()];
            pmax=i;
        }
    }
    out<<pmax-k+1<<" "<<pmax<<" "<<maxim;
    return 0;
}