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