#include <iostream>
#include<fstream>
#include<deque>
using namespace std;
int a,i,n,x,k,mx,poz;
deque <int> dq,pq;
int main()
{
    ifstream f("secventa.in");
    ofstream g("secventa.out");
  f>>n;
  f>>k;
  for(i=1;i<=n;i++)
  {
      f>>x;
      if(!dq.empty()&& pq.front()<=i-k)
      {

          dq.pop_front();
          pq.pop_front();
      }
      while(!dq.empty()&& dq.back()>=x)
      {
          dq.pop_back();
          pq.pop_back();
      }
      dq.push_back(x);
      pq.push_back(i);
      if(dq.front()>mx)
    {mx=dq.front();
    poz=i;}

  }
  g<<poz-k+1<<" "<<poz<<" "<<mx;
  f.close();
  g.close();
    return 0;
}