#include <iostream>
#include <fstream>

using namespace std;

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

int n, k, i, st, dr, lg, maxim = -25005, v[50001], sol[4];
long long suma;

int main()
{
   f >> n >> k;
    for (i=1; i<=n; i++)
        f >> v[i];
     lg = k;
    while (lg <= n)
    {
         st = 1;
         dr = lg - 1;
         suma = 0;
          for (i=st; i<=dr; i++)
              suma += v[i];
          while (dr <= n)
          {
              if (suma > maxim)
              {
                  maxim = suma;
                  sol[1] = st;
                  sol[2] = dr;
                  sol[3] = suma;
              }
             st ++;
             dr ++;
             suma -= v[st-1];
             suma += v[dr];
          }
        lg ++;
    }
  g << sol[1] << " " << sol[2] << " " << sol[3];
    return 0;
}