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

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

void read(short* v, int n)
{
    for(int i = 0; i < n; i++)
        in >> v[i];
}

void update(int x, deque<short>& u)
{
    while(!u.empty())
    {
        if(x < u.back())
            u.pop_back();
        else
            break;
    }
    u.push_back(x);
}

int main()
{
    int n, k;
    in >> n >> k;
    short v[n];
    read(v, n);

    deque<short> u;
    short maxBaza = -30001, index;

    for(int i = 0; i < n; i++)
    {
        if(!u.empty() && i >= k) if(u.front() == v[i-k] && v[i-k+1] != v[i-k]) u.pop_front();

        if(i+1 < n) if(v[i] < v[i+1]) update(v[i], u);

        if(!u.empty())
        {
            if(v[i] < u.back()) update(v[i], u);
        }
        else update(v[i], u);

        if(i >= k-1)
            if(u.front() > maxBaza)
            {
                //cout << " i " << i << endl;
                //cout << maxBaza << endl;
                maxBaza = u.front();
                //cout << maxBaza << endl;
                index = i;
            }
    }

    //cout << maxBaza << " " << index << endl;
    out << index - k + 2 << " " << index + 1 << " " << maxBaza << endl;

    return 0;
}