#include <iostream>
#include <fstream>
using namespace std;
int n,k,i,min1[500001],v[500001],max1,p,u,st,dr;
int main()
{

ifstream f("secventa.in");
ofstream g("secventa.out");
f>>n>>k;
max1=-30001;
for(i=1;i<=n;i++)
f>>v[i];
p=u=1;
min1[p]=1;
for(i=2;i<=n;i++){
while(p<=u&&v[i]<=v[min1[u]])
{
u--;
}
u++;min1[u]=i;
while(p<=u&&i-min1[p]>=k){
p++;
}

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