#include <fstream>
#include <vector>
using namespace std;

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

int main() {
    int n, k;
    fin >> n >> k;
    int v[n];
    int maxSum, endPos;
    for (int i = 1; i <= n; i++) {
        fin >> v[i];
        v[i] += v[i - 1];
        if (i == k || (i > k && v[i] > maxSum)) {
            maxSum = v[i];
            endPos = i;
        }
    }

    int minSum = 250000, startPos;
    for (int i = 0; i <= endPos - k; i++)
        if (v[i] < minSum) {
            minSum = v[i];
            startPos = i + 1;
        }

    fout << startPos << " " << endPos << " " << maxSum - minSum;

    return 0;
}