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

ifstream fin("secv2.in");
ofstream fout("secv2.out");
ll sp[50001];
ll maxSum, leftB, rightB;

int main() {
    int n, k, v[50001];

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

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

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

    return 0;
}