#include <fstream>
#include <deque>

using namespace std;

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

deque <int> dq;

int v[500005],i,j,k,m,n,maxi;

int main()
{

    f>>n>>k;

    for(i=1;i<=n;i++)
        f>>v[i];

    for(i=1;i<=k;i++)
    {
        while(!dq.empty()&&v[dq.back()]>=v[i])
            dq.pop_back();
        dq.push_back(i);
    }
    int baza=1;
    maxi=v[dq.front()];

    for(i=k+1;i<=n;i++)
    {
        while(!dq.empty()&&v[dq.back()]>=v[i])
            dq.pop_back();
        dq.push_back(i);
        if(dq.front()<=i-k)
            dq.pop_front();
        if(v[dq.front()]>maxi)
        {
            baza=i-k+1;
            maxi=v[dq.front()];
        }
    }

    g<<baza<<" "<<baza+k-1<<" "<<maxi;

    return 0;

}