#include <fstream>
#include <queue>
#include <utility>

using namespace std;

int main()
{
    int N, K, i, a;
    pair<int, int> maximum = make_pair(-30001, -1);
    deque< pair<int, int> > dq;
    ifstream f("secventa.in");
    f >> N >> K;
    for (i = 1; i <= N; i++)
    {
        f >> a;
        if (!dq.empty())
        {
            if (i - dq.front().second == K)
                dq.pop_front();
            while (!dq.empty() && dq.back().first > a)
                dq.pop_back();
        }
        dq.push_back(make_pair(a, i));
        if (dq.size() == K && maximum.first < dq.front().first)
            maximum = dq.front();
    }

    ofstream g("secventa.out");
    g << maximum.second << " " << maximum.second + K - 1 << " " << maximum.first;
    g.close();
    return 0;
}