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

int maxx = -25005, inn = 0, minn = -25005, countt, act, n, k, v[50001], leftt = 1, rightt = 1;

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