#include <iostream>
#include <queue>

using namespace std;

int n, k, maxx, v[500005], poz;
deque<int> dq;

FILE* fin, * fout;

int pos = 2047;
char buffer[2048];

int readnr()
{
    if ( pos == 2047 )
    {
        fread(buffer, 1, 2047, stdin);
        pos = 0;
    }

    int nr = 0;

    while ( !(buffer[pos] >= '0' && buffer[pos] <= '9') )
        pos++;

    while ( buffer[pos] >= '0' && buffer[pos] <= '9' )
    {
        nr = nr * 10 + (buffer[pos] - '0');
        pos++;
    }

    return nr;
}

int main()
{
    freopen("secventa.in", "r", stdin);
    freopen("secventa.out", "w", stdout);

    n = readnr();
    k = readnr();

    maxx = -9999999;
    poz = 1;

    for ( int i = 1; i <= n; i++ )
        v[i] = readnr();

    for ( int i = 1; i <= n; i++ )
    {
        while ( !dq.empty() && (dq.front() + k) <= i )
            dq.pop_front();

        while ( !dq.empty() && v[dq.back()] >= v[i] )
            dq.pop_back();

        dq.push_back(i);

        if ( i >= k && v[dq.front()] > maxx )
        {
            maxx = v[dq.front()];
            poz = i - k + 1;
        }
    }

    cout << poz << " " << poz + k - 1 << " " << maxx;
}