#include <cstdio>
#include <vector>
#include <deque>
using namespace std;

vector <int> A;
deque <int> Q;
int n,k,begin,end,maxim;


void Read(){

    int i,x;
    freopen("secventa.in","r",stdin);

    scanf("%d%d",&n,&k);
    A.push_back(0);
    for (i=1;i<=n;++i){
        scanf("%d",&x);
        A.push_back(x);
        }
}

void Solve(){

    int i;

    for (i=1;i<=n;++i){

        while (!Q.empty() && A[i]<=A[Q.back()]) Q.pop_back();
        Q.push_back(i);
        if (Q.front()==i-k) Q.pop_front();
        if (i>=k) if (maxim<A[Q.front()]) {
                                          maxim=A[Q.front()];
                                          begin=Q.front();
                                          end=Q.back();
                                          }
        }
}

void Write(){

    freopen("secventa.out","w",stdout);

    printf("%d %d %d",begin,end,maxim);
}
int main()
{
    Read();
    Solve();
    Write();
    return 0;
}