#include <fstream>
#include <deque>

using namespace std;

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

int main() {
    int N, K;
    fin >> N >> K;
    deque<int> dq;
    vector<int> v(N);
    for (int i = 0; i < N; ++i) {
        fin >> v[i];
    }

    int maxBase = -30001, start = 0, end = 0;
    for (int i = 0; i < N; ++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 - 1 && (maxBase < v[dq.front()] || (maxBase == v[dq.front()] && start > i - K + 1))) {
            maxBase = v[dq.front()];
            start = i - K + 1;
            end = i;
        }
    }

    fout << start + 1 << ' ' << end + 1 << ' ' << maxBase;
    fin.close();
    fout.close();
    return 0;
}