#include <iostream>
#include <fstream>
#include <deque>

using namespace std;

ifstream fin("secventa.in");
ofstream fout("secventa.out");

struct minim
{
    int val;
    int st;
    int dr;
};

const int NMAX = 5000000 + 5;

deque <int> dq;

minim minn;

int n, nr;
long long int sum;
int v[NMAX];

void read()
{
    fin >> n >> nr;
    for (int i = 1; i <= n; ++i)
        fin >> v[i];
}

int main()
{
    read();
    for (int k = nr; k <= n; ++k)
        for (int i = 1; i <= n; ++i)
        {
            //scoti de la inceput cat e nevoie
            //scoti de la sfarsit a.i sa fie cresc
            //add
            //verif daca i >= k
            while (!dq.empty() && dq.front() < i - k + 1)
                dq.pop_front();

            while (!dq.empty() && v[dq.back()] > v[i])
                dq.pop_back();

            dq.push_back(i);

            if (i >= k && minn.val < v[dq.front()])
            {
                minn.val = v[dq.front()];
                minn.st = dq.front();
                minn.dr = dq.back();
            }
        }
    fout << minn.st << " " << minn.dr << " " << minn.val << '\n';
    return 0;
}