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

const int INF=0x3f3f3f3f;

int i,n,k,st=1,dr,p1,a[500005],deq[500005],rs;

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

  cin>>n>>k;
  for(i=1;i<=n;++i) cin>>a[i];

  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;
}