#include <fstream>
#include <deque>
using namespace std;

int n, k, maxBaza = -40000, resi, x;
ifstream fin("secventa.in");
ofstream fout("secventa.out");

struct nod {
    int val, poz;
};

int main() {
    fin >> n >> k;
    deque<nod> q;

    for(int i = 1; i <= n; i++) {
        fin >> x;
        while(!q.empty() && q.front().val >= x)
            q.pop_front();
        q.push_front({x, i});

        while(!q.empty() && q.back().poz < i-k+1)
            q.pop_back();

        if (i >= k && q.back().val > maxBaza) {
            maxBaza = q.back().val;
            resi = q.back().poz;
        }
    }
    fout << resi << ' ' << resi+k-1 << ' ' << maxBaza;
}