#include <fstream>
#include <climits>
#include <deque>

using namespace std;

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

int main() {
    int n, k;
    fin >> n >> k;

    int minimum = INT_MIN, ans_i, ans_j;
    deque <int> dq;

    int a[n + 1];
    for (int i = 1; i <= n; i++) {
        fin >> a[i];
    }

    for (int i = 1; i <= n; i++) {
        while (!dq.empty() && a[dq.back()] > a[i]) {
            dq.pop_back();
        }
        dq.push_back(i);
        if (dq.front() <= i - k) {
            dq.pop_front();
        }
        if (dq.front() > minimum && i >= k) {
            minimum = a[dq.front()];
            ans_i = i - k + 1;
            ans_j = i;
        }
    }

    fout << ans_i << " " << ans_j << " " << minimum << endl;
}