#include <fstream>
#include <deque>
#include <cstring>

using namespace std;

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

int n, k, v[500005], maxim = -3000005, st, dr, i, numar;
bool semn;
char s[500005];
deque < int > coada;

int main()
{
 f >> n >> k;
 f.get();
 f.getline(s, sizeof(s));
  n = 0;
   for (i=0; s[i]; i++)
   {
      if (s[i] >= '0' && s[i] <= '9')
      {
          if (s[i-1] == '-')
            semn = true;
          else
            semn = false;

            numar = 0;
           while (s[i] >= '0' && s[i] <= '9')
           {
               numar = numar * 10 + s[i] - '0';
               i ++;
           }
          if (semn)
            numar = -numar;
          n ++, v[n] = numar;
      }
   }

    for (i=1; i<=n; i++)
    {
         while (!coada.empty() && v[i] <= v[coada.back()])
          coada.pop_back();

         coada.push_back(i);

       if (coada.front() <= i-k)
           coada.pop_front();

       if (i >= k && v[coada.front()] > maxim)
       {
           maxim = v[coada.front()];
           st = i-k+1;
           dr = i;
       }
    }
 g << st << " " << dr << " " << maxim;
 f.close();
 g.close();
    return 0;
}