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

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

const int INF = 1 << 30;
const int MAX_N = 500100;
int N, K;
int v[MAX_N];
deque<int> dq;

int main() {
    in >> N >> K;
    int best = -INF, b = 0;
    for (int i = 1; i <= N; ++i) {
        in >> 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;
}