#include <fstream>
#include <deque>
#include <stack>


using namespace std;

int a[500100];
deque<int> dq;

int main()
{
    ifstream f("secventa.in");
    ofstream g("secventa.out");

    int n, k;
    f >> n >> k;

    for (int i = 1; i <= n; ++i)
    {
        f >> a[i];
    }


    int st = 0, dr = 0, bmax = -400000;

    for (int i = 1; i <= k; ++i)
    {
        int x = a[i];
        while (!dq.empty() && x < dq.back())
        {
            dq.pop_back();
        }
        dq.push_back(a[i]);

        int baza = dq.front();
        if (baza > bmax)
        {
            bmax = baza;
            st = 1;
            dr = k;
        }
    }

    for (int i = k + 1; i <= n; ++i)
    {
        int y = a[i - k];
        if (dq.front() == y)
            dq.pop_front();

        int x = a[i];
        while (!dq.empty() && x < dq.back())
        {
            dq.pop_back();
        }
        dq.push_back(a[i]);

        int baza = dq.front();
        if (baza > bmax)
        {
            bmax = baza;
            st = i - k + 1;
            dr = i;
        }
    }

    g << st << " " << dr << " " << bmax << "\n";


    return 0;
}