#include<fstream>
#include<deque>
#define maxn 500010
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
long n,k;
int v[maxn];
long poz1,poz2,val;
deque<int> deck;


int main(){
f>>n>>k;
for (int i=1;i<=n;i++)
f>>v[i];
for(int i=1;i<=n;i++){
while(deck.size()!=0&&v[i]<=v[deck.back()])
deck.pop_back();

deck.push_back(i);

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

if(i>=k&&v[deck.front()]>val)
val=v[deck.front()],poz1=i-k+1,poz2=i;
}

g<<poz1<<' '<<poz2<<' '<<val;
return 0; 
}