#include <cstdio>

using namespace std;

long sp [50008];
long Q [50008];

int main () {
    long N, K, i, a, u, p, st, dr, smax = -2000000000, min, poz;

    freopen ("secv2.in", "r", stdin);
    freopen ("secv2.out", "w", stdout);

    scanf ("%ld%ld", &N, &K);
    for (i = 1; i <= N; i ++) {
        scanf ("%ld", &a);
        sp [i] = sp [i - 1] + a;
    }
    min = 2000000000;
    for (i = K; i <= N; i ++) {
        if (sp [i - K] < min)  {
            min = sp [i - K];
                poz = i - K + 1;
        }
        if (sp [i] - min > smax) {
            smax = sp [i] - min;
            st = poz;
            dr = i;
        }
    }
    printf ("%ld %ld %ld\n",st, dr, smax);
    return 0;
}