#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

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

    int n, k;
    if (!(fin >> n >> k)) return 0;

    vector<int> s(n + 1, 0);
    for (int i = 1; i <= n; ++i) {
        int x;
        fin >> x;
        s[i] = s[i - 1] + x;
    }

    int max_sum = s[k];
    int best_l = 1, best_r = k;
    int min_s = 0, min_pos = 0;

    for (int i = k; i <= n; ++i) {
        int j = i - k;
        if (s[j] < min_s) {
            min_s = s[j];
            min_pos = j;
        }

        int crt_sum = s[i] - min_s;
        if (crt_sum > max_sum) {
            max_sum = crt_sum;
            best_l = min_pos + 1;
            best_r = i;
        }
    }

    fout << best_l << " " << best_r << " " << max_sum << "\n";
    return 0;
}