#include <fstream>
#include <deque>

using namespace std;
int n, k, sol, v[500050];

deque <int >d;
long long s, inceput, sfarsit;
int main()
{
ifstream f("secventa.in");
ofstream g("secventa.out");
f>>n>>k;
int i;
for(i=1;i<=n;i++)
{

f>>v[i];
while(!d.empty()&& v[i]<=v[d.back()] )
d.pop_back();
d.push_back(i);

if(d.front()==i-k)
d.pop_front();

if(d.size()>=k && v[d.front()]>sol )
{
  sol=v[d.front()];
  sfarsit=i;

}
}
g<<sfarsit-k+1<<" "<<sfarsit<<" "<<sol;
///d.push_back(make_pair( v,i ));
/*if( d.front().second +k==i )
{
  inceput=i;
	d.pop_front();

}
s+=i<k-1? 0:d.front().first;
//sfarsit=i;
}
*/

return 0;




}