#include <bits/stdc++.h>

using namespace std;

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

int v, n, i, i1, i2, k, st;
int s[50005];

long long sum, ssm;

int main(){
    fin >> n >> k;
    for (i=1; i<=n; i++){
        fin >> v;
        s[i] = s[i-1] + v;
    }
    sum = LLONG_MAX;
    ssm = LLONG_MIN;
    for (i=k; i<=n; i++){
        if (s[i-k] < sum){
            sum = s[i-k];
            st = i - k + 1;
        }
        if (s[i] - sum > ssm){
            ssm = s[i] - sum;
            i1 = st;
            i2 = i;
        }
    }
    fout << i1 << " " << i2 << " " << ssm;
    return 0;
}
//100p