#include <fstream>
#include <deque>

using namespace std;

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

int n, k, v[500001], aux, maxim, st, dr, i;
deque < int > coada;

int main()
{
 f >> n >> k;
  for (i=1; i<=n; i++)
     f >> v[i];
  for (i=1; i<=n; i++)
  {
      aux = v[i];
       while (!coada.empty() && v[coada.back()] >= aux)
        coada.pop_back();
       coada.push_back(i);
    if (coada.front() == i-k)
        coada.pop_front();
    if (i >= k)
    {
       if (v[coada.front()] > maxim)
       {
           maxim = v[coada.front()];
           st = i-k+1;
           dr = i;
       }
    }
  }
 while (v[st-1] >= maxim)
 {
     st --;
 }
 g << st << " " << dr << " " << maxim;
    return 0;
}