#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;


long st = 0, dr, n, k, v[100001], best = -2000000000, min = 0;
int main()
{
    freopen("secv2.in", "r", stdin);
    freopen("secv2.out", "w", stdout);
    long i;
    scanf("%ld %ld", &n, &k);
    v[0] = 0;
    for(i = 1; i <= n; i++)
    {
          scanf("%ld", &v[i]);
          v[i] += v[i - 1];
          if(v[i] < min)
          {
                  min = v[i];
                  st = i;
          }
          if((v[i] - min > best) && (i - st + 1 >= k)) 
          {
                   best = v[i] - min;
                   dr = i;
          }
    }
    if(n == k) { printf("1 %ld %ld\n", n, v[n]); return 0;}
    printf("%ld %ld %ld\n", st + 1, dr, best);
    return 0;
}