#include <bits/stdc++.h>

using namespace std;

ifstream fin("secventa.in");

ofstream fout("secventa.out");

deque <long long> d;

int n, k, v[500005], vmax, st, dr;

int main()
{

    fin>>n>>k;

    for(int i=1;i<=n;++i)

        fin>>v[i];

    vmax=-30001;

    for(int i=1;i<=n;++i)
    {
        while(!d.empty() && v[i]<v[d.back()])

            d.pop_back();

        d.push_back(i);

        if(i>=k)

        {
            if(d.front()==i-k && !d.empty()) d.pop_front();

            if(v[d.front()]>vmax)
        {
            vmax=v[d.front()];

            st=i-k+1;

            dr=i;
        }
        }


    }

    fout<<st<<" "<<dr<<" "<<vmax;


    return 0;
}