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

int maxx, countt, act, n, k, v[50001], leftt, rightt;

int main() {
    ifstream fin("secv2.in");
    ofstream fout("secv2.out");
    fin >> n >> k;
    for (int i = 1; i <= n; ++i) {
        fin >> v[i];
    }
    for (int i = 1; i <= n; ++i) {
        act = act + v[i];
        ++countt;
        if (maxx < act && countt >= k) {
            maxx = act;
            rightt = i;
        }
        if (act < 0) {
            act = 0;
            countt = 0;
        }
    }
    int i = rightt, summ = 0;
    while (summ < maxx) {
        summ = summ + v[i];
        leftt = i;
        --i;
    }
    fout << leftt << ' ' << rightt <<  ' ' << maxx;
    return 0;
}