#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
deque <int> dq;
int n, k, baza_max = -30001, inceput, sfarsit, v[500005];

int main() {
    fin >> n >> k;
    for (int i = 1; i <= n; ++i) {
        fin >> v[i];
        if (!dq.empty()) {
            if (i >= k) {
                if (dq.front() < i - k + 1)
                    dq.pop_front();
                if (v[dq.front()] > baza_max) {
                    baza_max = v[dq.front()];
                    inceput = i - k + 1;
                    sfarsit = i;
                }
            }
            while (v[dq.back()] > v[i]) {
                dq.pop_back();
                if (dq.empty())
                    break;
            }
        }
        dq.push_back(i);
    }
    fout << inceput << " " << sfarsit << " " << baza_max;
    return 0;
}