#include <cstdio>

using namespace std;

const int maxn = 50005;
int n, k, v[maxn], start, end, sum = -0x3f3f3f3f, pozmin, minim;

int main()
{
    int i;
    freopen ("secv2.in", "r", stdin);
    freopen ("secv2.out", "w", stdout);
    scanf("%d %d", &n, &k);
    for(i = 1; i <= n; ++i) {
        scanf("%d", &v[i]);
        v[i] += v[i - 1];
    }
    if(k == n) {
        printf("1 %d %d\n", n, v[n]);
        return 0;
    }
    for(i = 1; i <= n; ++i) {
        if(v[i] < minim) {
            minim = v[i];
            pozmin = i;
        }
        if((v[i] - minim > sum) && (i - pozmin + 1 >= k)) {
            start = pozmin + 1;
            end = i;
            sum = v[i] - minim;
        }
    }
    printf("%d %d %d\n", start, end, sum);

    return 0;
}