//https://infoarena.ro/problema/secventa

#include <fstream>
#include <deque>
using namespace std;

ifstream in("secventa.in");
ofstream out("secventa.out");

struct secventa
{
int minim;
int incp;
int sfar;

};

deque<int> q;
secventa sec_max;
int nr[500005];

void add_q(int x)
{
while(!q.empty() && nr[q.back()] > nr[x])
q.pop_back();

q.push_back(x);
}

void update_secv_max(secventa aux)
{
if(aux.minim > sec_max.minim)
{
sec_max = aux;
}
else if (aux.minim == sec_max.minim)
{
if(aux.incp < sec_max.incp)
{
sec_max = aux;
}
else if (aux.incp == sec_max.incp)
{
if(aux.sfar < sec_max.sfar)
{
sec_max = aux;
}
}
}
}

int main()
{
int n, k;
in>>n>>k;

for(int i=1; i<=n; i++)
in>>nr[i];

for(int i = 1; i<k; ++i)
{
add_q(i);
}

for(int i = k; i <= n; ++i)
{
// pe cine eliminam
int poz_elim = i-k;

if(poz_elim == q.front())
q.pop_front();

add_q(i);

secventa aux;
aux.incp = i-k+1;
aux.sfar = i;
aux.minim = nr[q.front()];

update_secv_max(aux);
}

out<<sec_max.incp <<" ";
out<<sec_max.sfar <<" ";
out<<sec_max.minim <<" ";



in.close();
out.close();
return 0;
}