#include <cstdio>
#include <deque>

using namespace std;

int n, k;
int sir[5000005];
int valMin, pos;

void solve(){
    scanf("%d %d", &n, &k);

    for(int i = 0; i < n; i++){
        scanf("%d", &sir[i]);
    }

    deque<int> dq;

    for(int i = 0; i < k; i++){
        while(dq.size() > 0 && sir[dq.back()] > sir[i]){
            dq.pop_back();
        }
        dq.push_back(i);
    }

    valMin = sir[dq.front()];
    pos = 0;

    for(int i = k; i < n; i++){
        while(dq.front() < i - k + 1){
            dq.pop_front();
        }

        while(dq.size() > 0 && sir[dq.back()] > sir[i]){
            dq.pop_back();
        }

        dq.push_back(i);

        if(sir[dq.front()] > valMin){
            valMin = sir[dq.front()];
            pos = i - k + 1;
        }
    }

    printf("%d %d %d", pos + 1, pos + k, valMin);
}

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

    solve();

    return 0;
}