#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int i,u,p,v[500005],k,d[500005],n,sol,sol1;
long long maxim;
int main(){
    fin>>n>>k;
    maxim=-15000000000;
    for(i=1;i<=n;i++){
        fin>>v[i];
    }
    d[1]=1;
    p=1;
    u=1;
    for(i=2;i<=n;i++){
        while(p<=u && v[i]<=v[d[u]]){
            u--;
        }
        u++;
        d[u]=i;
        if(i-d[p]==k){
            p++;
        }
        if(i>=k){
            if(v[d[p]]>maxim){
                maxim=v[d[p]];
                sol=i-k+1;
                sol1=i;
            }
        }
    }
    fout<<sol<<" "<<sol1<<" "<<maxim;
return 0;
}