#include <cstdio>
#include <deque>

using namespace std;

deque <int> dq;
int v[500005];

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

    int n, k, minim = -999999999, a, b;
    scanf("%d%d", &n, &k);

    for(int i = 1; i <= n; ++ i) {
        scanf("%d", &v[i]);
        while(!dq.empty() && v[dq.back()] >= v[i]) {
            dq.pop_back();
        }
        dq.push_back(i);
        if(i - dq.front() + 1 > k) {
            dq.pop_front();
        }
        if(i >= k) {
            if(v[dq.front()] > minim) {
                minim = dq.front();
                a = i - k + 1;
                b = i;
            }
        }
    }

    printf("%d %d %d", a, b, minim);

    return 0;
}