#include <fstream>
#include <deque>
using namespace std;
ifstream fi("secventa.in");
ofstream fo("secventa.out");
int n,k,i,a[500001],maxi=-100000000,p1,p2;
deque<int> d;

int main()
{fi>>n>>k;
 for(i=1;i<=n;i++) fi>>a[i];

for(i=1;i<=n;i++)
 {
  while(!d.empty() and a[d.back()]>=a[i]) d.pop_back();
  while(!d.empty() and d.front() < i-k+1) d.pop_front();
  d.push_back(i);
  if(i>=k and maxi<a[d.front()])  {maxi=a[d.front()];
                                   p1=d.front();
                                   p2=i;}
 }
fo<<p1<<" "<<p2<<" "<<maxi;
    return 0;
}