#include <fstream>
using namespace std;

ifstream f("secv2.in");
ofstream g("secv2.out");

int n, s[50005], sMax, in, sf, k;

void sumMax() {
    sMax = s[k], in = 1, sf = k;
    int minim =  s[1], inceput  = 1;
    for(int i = k+1; i <= n; i++) {
        if(s[i-k] < minim) {
            minim = s[i-k];
            inceput = i-k+1;
        }
        if(s[i]- minim > sMax) {
            sMax = s[i]-minim;
            in = inceput;
            sf = i;
        }
    }
}

int main() {
    f >> n >> k;
    for(int i = 1; i <= n; i++) {
        f >> s[i];
        s[i] += s[i-1];
    }
    sumMax();
    g << in << ' ' << sf <<  ' ' << sMax;
}