#include <bits/stdc++.h>
using namespace std;

int main() {
    freopen("secventa.in", "r", stdin);
    freopen("secventa.out", "w", stdout);

    int n, k;
    scanf("%d%d", &n, &k);

    vector<int> v(n);
    deque<int> q;
    for (int &i : v) {
        scanf("%d", &i);
    }
    auto push = [&] (int i) {
        while (!q.empty() && v[q.back()] >= v[i]) {
            q.pop_back();
        }
        q.push_back(i);
    };

    for (int i = 0; i < k; i++) {
        push(i);
    }

    int mx = v[q.front()];
    int st = 0;

    for (int i = k; i < n; i++) {
        if (v[i-k] == v[q.front()] && q.front() <= i - k) q.pop_front();
        push(i);
        if (v[q.front()] > mx) {
            mx = v[q.front()];
            st = i - k + 1;
        }
    }
    printf("%d %d %d", st + 1, st + k, mx);
}