#include <fstream>
#include <deque>
const int N=5000003;
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
deque <int> d;
int n,v[N],k;
int st,dr,Max=-999999999;
int main()
{
    f>>n>>k;
    for(int i=1;i<=n;i++)
    {
        f>>v[i];
    }
    for(int i=1;i<=n;i++)
    {
        while(!d.empty()&&v[d.back()]>=v[i])
        {
            d.pop_back();
        }
        d.push_back(i);
        if(d.front()+k==i)
        {
            d.pop_front();
        }
        if(i>=k)
        {
            if(Max<v[d.front()])
            {
                Max=v[d.front()];
                st=i;
                dr=i-k+1;
            }
            //g<<Max<<" "<<v[d.front()]<<"\n";
        }
    }
    //g<<"\n";
    g<<dr<<" "<<st<<" "<<Max;
    f.close();
    g.close();
    return 0;
}