#include<fstream>
#define MAXN 50001

using namespace std;

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

long sum, bestsum, bestb, beste;
int a, b, e;
long S[MAXN], minS;
int n, k;

int main() {
    fin>>n>>k;
    for(int i=1; i<=n; i++) {
        fin>>S[i];
        S[i]+=S[i-1];
    }
    bestsum = S[k];
    minS = S[0];
    bestb = 0;
    beste = k;
    b = 0;
    for(int e=k+1; e<=n; e++) {
        if(minS > S[e-k]) {
            minS = S[e-k];
            b = e-k;
        }
        if(bestsum < S[e] - S[b]) {
            bestsum = S[e] - S[b];
            bestb = b;
            beste = e;
        }
    }
    fout<<bestb+1<<" "<<beste<<" "<<bestsum;

    return 0;
}