#include <fstream>
#include <deque>

using namespace std;

deque < pair <int,int> > d;

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

int main()
{
    int n,k,i,x,max1=0,fin,st;
    long long sum=0;
    in>>n>>k;
    for (i=1;i<=n;i++)
    {
      in>>x;
      while (!d.empty()&&x<=d.back().first)
            d.pop_back();
      d.push_back(make_pair(x,i));
      if (d.front().second==i-k)
        d.pop_front();
      if (i>=k)
        {
          if (d.front().first>max1)
            max1=d.front().first,fin=i,st=i-k+1;
        }
    }
    out<<st<<" "<<fin<<" "<<max1;
    return 0;
}