#include<cstdio>
#include<deque>
using namespace std;
int v[500001],n,k,ad,ci,cs,mini;
deque<int>D;
int main(){
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++)
        scanf("%d",&v[i]);
    for(int i=1;i<=k;i++){
        ad=i;
        while(!D.empty()&&v[D.back()]>v[ad])
            D.pop_back();
        D.push_back(ad);
    }
    mini=v[D.front()];
    ci=1;
    cs=k;
    for(int i=2;i<=n-k+1;i++){
        while(!D.empty()&&D.front()<i)
            D.pop_front();
        ad=i+k-1;
        while(!D.empty()&&v[D.back()]>v[ad])
            D.pop_back();
        D.push_back(ad);
        if(v[D.front()]>mini){
            mini=v[D.front()];
            ci=i;
            cs=i+k-1;
        }
    }
    printf("%d %d %d",ci,cs,mini);
    return 0;
}