#include<cstdio>
#include<deque>
#include<algorithm>
#define f first
#define s second
using namespace std;
deque<pair<int,int> > mn;
int n, i, sol, unde, k, x;
int main(){
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    scanf("%d%d", &n, &k);
    for (i=1;i<=k;i++) {
        scanf("%d", &x);
        while ((!mn.empty())&&(x<(mn.back()).f)) mn.pop_back();
        mn.push_back(make_pair(x, i));
    }
    sol=(mn.front()).f; unde=k;
    for (i=k+1;i<=n;i++) {
        scanf("%d", &x);
        while ((!mn.empty())&&(x<(mn.back()).f)) mn.pop_back();
        mn.push_back(make_pair(x, i));
        while ((!mn.empty())&&((mn.front()).s<i-k+1)) mn.pop_front();
        if ((mn.front()).f>sol) {sol=(mn.front()).f; unde=i;}
    }
    printf("%d %d %d", unde-k+1, unde, sol);
    return 0;
}