#include <fstream>
using namespace std;

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

const int NMAX = 50005;
long long s[NMAX];

int main() {
    int n, k;
    fin >> n >> k;

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

    long long sum_max = 0;
    int ans_i = 0, ans_j = 0;

    long long s_min = 0;
    int poz_min = 0;

    for (int j = k; j <= n; j++) {
        if (s[j - k] < s_min) {
            s_min = s[j - k];
            poz_min = j - k;
        }

        long long candidat = s[j] - s_min;
        if (j == k || candidat > sum_max) {
            sum_max = candidat;
            ans_i = poz_min + 1;
            ans_j = j;
        }
    }

    fout << ans_i << " " << ans_j << " " << sum_max << "\n";
    return 0;
}