#include<fstream>
#include<algorithm>
#include<string>
using namespace std;

const int INF=0x3f3f3f3f;

int i,n,k,poz,st=1,dr,p1,a[500005],deq[500005],rs;
string s;
string :: iterator it;

int read() {
    bool semn=1;
    int nr=0;
    while((*it<'0' || *it>'9') && *it!='-') ++it;

    if(*it=='-') semn=0,++it;

    while(it!=s.end() && *it>='0' && *it<='9')
    nr*=10,nr+=*it-'0',++it;
    if(!semn) return -nr;
    return nr;
}

int main()
{
  ifstream cin("secventa.in");
  ofstream cout("secventa.out");

  getline(cin,s,(char)0); it=s.begin();
  n=read(); k=read();
  for(i=1;i<=n;++i) a[i]=read();

  for(i=1,rs=-INF;i<=n;++i)
  {
    while(st<=dr && a[i]<=a[deq[dr]]) --dr;
    deq[++dr]=i;
    if(deq[st]<=i-k) ++st;
    if(i>=k && rs<a[deq[st]]) rs=a[deq[st]],p1=i;
  }

  cout<<p1-k+1<<' '<<p1<<' '<<rs<<'\n';

 return 0;
}