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

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

int main() {
    int N, K;
    fin >> N >> K;
    vector<int> a(N + 1);
    for (int i = 1; i <= N; i++) fin >> a[i];

    deque<int> dq;
    int bestBase = -40001;
    int bestL = 1, bestR = K;

    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 (i >= K) {
            int currentBase = a[dq.front()];
            if (currentBase > bestBase) {
                bestBase = currentBase;
                bestL = i - K + 1;
                bestR = i;
            }
        }
    }

    fout << bestL << " " << bestR << " " << bestBase << "\n";
    return 0;
}