#include <fstream>
#include <deque>

using namespace std;

deque<pair<int, int>> dq;

int main()
{
    ifstream in("secventa.in");
    ofstream out("secventa.out");
    int n, k, x;

    in >> n >> k;

    int solMax = -30001;
    int solSt = -1;
    int solDr = -1;

    for (int i = 1; i <= k - 1; i++)
    {
        in >> x;

        while (!dq.empty() && dq.front().first >= x)
        {
            dq.pop_front();
        }

        dq.push_front(make_pair(x, i));
    }

    for (int i = k; i <= n; i++)
    {
        in >> x;

        while (!dq.empty() && dq.front().first >= x)
        {
            dq.pop_front();
        }

        dq.push_front(make_pair(x, i));

        if (dq.back().second < i - k + 1)
        {
            dq.pop_back();
        }

        if (dq.back().first > solMax)
        {
            solMax = dq.back().first;

            solSt = i - k + 1;
            solDr = i;
        }
    }

    out << solSt << ' ' << solDr << ' ' << solMax << '\n';

    return 0;
}