#include<fstream>
#include<iostream>
using namespace std;

#define MAXN 50010
#define Max(a, b)  ((a) > (b) ? (a) : (b))

int S[MAXN], n,k;

int main(void)
{
    int i,bestSum,min,idx,beg,end;
    ifstream oin("secv2.in");
    oin >> n >> k;
    for(i = 1; i <= n; i++) oin >> S[i];

    bestSum = 0,min = 0, beg = 1, end = k;
    for(i = 1; i <= k; i++) bestSum += S[i];
    for(i = 1; i <= n; i++)
    {
        S[i] += S[i - 1];
        if (bestSum < S[i] - min && i-idx+1 >= k)
            bestSum = S[i] - min, beg = idx + 1, end = i;
        if (min > S[i])
            min = S[i], idx = i;
    }
    ofstream out("secv2.out");
    out << beg << " " << end << " " << bestSum;

    oin.close(),out.close();
    return 0;
}