#include<fstream>
#define MAXN 50001

using namespace std;

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

int sum, bestsum, bestb, beste;
int a, b, e;
int T[MAXN];
int n, k;

int main() {
    fin>>n>>k;
    for(int i=1; i<=k; i++) {
        fin>>T[i];
        sum += T[i];
    }
    bestsum = sum;
    bestb = b = 1;
    beste = k;
    for(e=k+1; e<=n; e++) {
        fin>>a;
        sum += a;
        while(e-b+1 >= k and sum < sum - T[b])
            b++;
        if(bestsum < sum) {
            bestsum = sum;
            bestb = b;
            beste = e;
        }
    }
    fout<<bestsum<<" "<<bestb<<" "<<beste;

    return 0;
}