#include <fstream>
#include <deque>

using namespace std;

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

int n, k, psol, i, pfront;
short x, sol;
deque<int> d;

int main()
{
    fin >> n >> k;
    for(i = 1; i <= k; ++i)
    {
        fin >> x;
        while(!d.empty() && x < d.back())
            d.pop_back();
        d.push_back(x);
    }
    sol = d.front(), psol = k, pfront = 1;
    for(i = k + 1; i <= n; ++i)
    {
        fin >> x;
        while(!d.empty() && x < d.back())
            d.pop_back();
        if(d.empty())
            pfront = i;
        if(!d.empty() && pfront + k == i)
            d.pop_front();
        d.push_back(x);
        if(d.front() > sol)
        {
            sol = d.front();
            psol = i;
        }
    }
    fout << psol - k + 1 << ' ' << psol << ' ' << sol;
    return 0;
}