#include <bits/stdc++.h>

using namespace std;

ifstream f("secventa.in");
ofstream g("secventa.out");

deque <int> d;

int n,k,i,maxim,u,p,x,v[500010];

int main()
{
    f>>n>>k;
    for(i=1;i<=n;i++)f>>v[i];

    for(i=1;i<=n;i++)
    {
        x=v[i];
        while(d.size() && x<=v[d.front()])d.pop_front();
        d.push_front(i);

        if(i-d.back()>=k)d.pop_back();
        if(i>=k)
        {
            x=v[d.back()];
            if(x>maxim)
            {
                u=i;
                p=i-k+1;
                maxim=x;
            }
        }
    }

    g<<p<<" "<<u<<" "<<maxim;
    return 0;
}