#include<bits/stdc++.h>

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

const int MAX = 5e5 + 5;
const int LOG_MAX = 19;
int n, k, sol = -1e9, st, dr;
short rmq[LOG_MAX][MAX], E[MAX];

void build(){
    for(int i = 1; i <= n; ++i)
        fin >> rmq[0][i];

    for(int i = 1; (1 << i) <= n; ++i)
    for(int j = 1; j <= n; ++j){
        rmq[i][j] = rmq[i - 1][j];
        if(j + (1 << (i - 1)) <= n)
            rmq[i][j] = std::min(rmq[i][j], rmq[i - 1][j + (1 << (i - 1))]);
    }

    E[1] = 0;
    for(int i = 2; i <= n; ++i)
        E[i] = E[i / 2] + 1;
}

void query(int left, int right){
    int len = right - left + 1, e = E[len];
    int res = std::min(rmq[e][left], rmq[e][right - (1 << e) + 1]);
    if(res > sol){
        sol = res;
        st = left;
        dr = right;
    }
}

int main(){
    fin >> n >> k;
    build();
    for(int i = 1; i <= n - k + 1; ++i)
        query(i, i + k - 1);
    fout << st << ' ' << dr << ' ' << sol;
}