#include <iostream>
#include <fstream>
#include <deque>
using namespace std;

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

struct elem
{
    short val;
    int poz;
};

int n, k, sol = -32000, psol;
deque<elem> dq;

int main()
{
    int i, x;
    f >> n >> k;
    for(i = 1; i <= k; ++i)
    {
        f >> x;
        while(!dq.empty() && x < dq.back().val)
            dq.pop_back();

        dq.push_back({x, i});
    }

    sol = dq.front().val, psol = k;

    for(i = k + 1; i <= n; ++i)
    {
        f >> x;
        while(!dq.empty() && x < dq.back().val)
            dq.pop_back();

        if(!dq.empty() && dq.front().poz + k == i)
            dq.pop_front();

        dq.push_back({x, i});

        if(dq.front().val > sol)
            sol = dq.front().val, psol = i;
    }
    g << psol - k + 1 << ' ' << psol << ' ' << sol;
    f.close();
    g.close();
    return 0;
}