#include <cstdio>
#include <algorithm>
using namespace std;

const int NMAX = 50010;

int N, K, X, S[NMAX], Min, Start, End, Ans, PosMin;

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

    scanf("%i %i", &N, &K);
    for(int i = 1; i <= N; ++ i)
    {
        scanf("%i", &X);
        S[i] = S[i - 1] + X;
        if(i >= K)
        {
            if(S[i - K] < Min) Min = S[i - K], PosMin = i - K + 1;
            if(S[i] - Min > Ans) Ans = S[i] - Min, Start = PosMin, End = i;
        }
    }

    printf("%i %i %i\n", Start, End, Ans);
}