#include <algorithm>
#include <deque>
#include <fstream>
#include <iostream>
#include <utility>
using namespace std;
#define INFOARENA

#ifdef INFOARENA
    ifstream in("secventa.in");
    ofstream out("secventa.out");
#else
    #define out cout
    #define in cin
#endif

namespace {
    const int BUFFER_LIMIT = 1000000;

    int char_counter = BUFFER_LIMIT - 1;
    char buffer[BUFFER_LIMIT];

    inline void check_buffer() {
        (++char_counter == BUFFER_LIMIT) ? (in.read(buffer, BUFFER_LIMIT), char_counter = 0) : (1);
    }

    void parse_integer(int &x){
        bool ok = 0;
        while (!((buffer[char_counter] >= '0' && buffer[char_counter] <= '9') || (buffer[char_counter] == '-' ))) check_buffer();

        if (buffer[char_counter] == '-') {
            check_buffer();
            ok = 1;
        }

        for (x = 0; (buffer[char_counter] >= '0' && buffer[char_counter] <= '9'); x *= 10, x += (buffer[char_counter] - '0'), check_buffer());

        if (ok) {
            x = -x;   
        }
    }
}
const int INF = 1 << 30;
const int MAX_N = 500100;
int N, K;
int v[MAX_N];
deque<int> dq;

int main() {
    parse_integer(N), parse_integer(K);
    int best = -INF, b = 0;
    for (int i = 1; i <= N; ++i) {
        parse_integer(v[i]);
        while (!dq.empty() && v[dq.back()] > v[i]) {
            dq.pop_back();
        }
        dq.push_back(i);
        if (dq.front() == i - K) {
            dq.pop_front();
        }

        if (i >= K && v[dq.front()] > best) {
            best = v[dq.front()];
            b = i;
        }
    }

    out << b - K + 1 << ' ' << b << ' '  << best;
    return 0;
}