#include <bits/stdc++.h>
#define ll long long
using namespace std;

ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n, v[50001], k, maxSum = INT_MIN, leftB, rightB;
int sp[50001];

int main() {
    fin >> n >> k;
    for (int i = 1; i <= n; i++) {
        fin >> v[i];
        sp[i] = sp[i - 1] + v[i];
    }

    int start = 1, currSum = sp[k];
    for (int i = k + 1; i <= n; i++) {
        currSum += v[i];
        if (sp[i] - sp[i - k] > currSum) {
            start = i - k + 1;
            currSum = sp[i] - sp[i - k];
        }
        
        if (maxSum < currSum) {
            maxSum = currSum;
            leftB = start, rightB = i;
        }
    }

    fout << leftB << " " << rightB << " " << maxSum;

    return 0;
}