#include <fstream>

using namespace std;

ifstream fin("secv2.in");
ofstream fout("secv2.out");

#define DM 50000

int n,k;
int v[DM + 1], sp[DM + 1];

int main() {
    fin >> n >> k;
    for(int i = 1; i <= n; i++) {
        fin >> v[i];
    }

    for(int i = 1; i <= n - k + 1; i++) {
        for(int j = i; j < i + k; j++) {
            sp[i] += v[j];
        }
    }

    int maxsum, sum;
    sum = maxsum =  sp[1];
    int lenght = k;
    int c1 = 1, c2 = 1;

    for(int i = 2; i <= n - k + 1; i++) {
        if(sum + v[c1 + lenght] < sp[i]) {
            c1 = i;
            lenght = k;
            sum = sp[i];
        } else {
            sum += v[c1 + lenght];
            lenght++;
        }

        if(sum > maxsum) {
            maxsum = sum;
            c2 = c1 + lenght - 1;
        }
    }

    fout << c1 << " " << c2 << " " << maxsum;

}