#include<fstream>
int n,k,i,minim[500001],v[500001],maxim,p,u,st,dr;

using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");

int main(){
f>>n>>k;
maxim=-30001;
for(i=1;i<=n;i++){
f>>v[i];
}
p=u=1;
minim[p]=1;
for(i=2;i<=n;i++){
while(p<=u&&v[i]<=v[minim[u]]){
u--;
}
u++;minim[u]=i;
while(p<=u&&i-minim[p]>=k){
p++;
}

if(v[minim[p]]>maxim&&i>=k){
    maxim=v[minim[p]];dr=i;}
}
g<<dr-k+1<<' '<<dr<<" "<<maxim;
return 0;}