#include <cstdio>
#include <fstream>
#include <deque>
#define nmax 500005
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,k,p,u,maxim=-nmax;
int v[nmax];
deque <int> a;

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

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

        while ((!a.empty())&&(v[a.back()]>=v[i]))
                    a.pop_back();
        a.push_back(i);

        if (i>=k&&v[a.front()]>maxim) {
               maxim=v[a.front()];
               p=i-k+1;
               u=i;
        }
        if (i-k+1==a.front()) a.pop_front();

    }


    g<<p<<' '<<u<<' '<<maxim<<'\n';
    return 0;
}