#include <bits/stdc++.h>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
const int N = 50005;
int n, k, x, v[N], st, dr, prim;
int main() {
    f >> n >> k;
    for (int i = 1; i <= n; i++) {
        f >> x;
        v[i] = x + v[i - 1];
    }
    int mini = 25000 * 50000, maxi = -25000 * 50000;
    for (int i = k; i <= n; i++) {
        if (v[i - k] < mini) {
            mini = v[i - k];
            prim = i - k + 1;
        }
        if (v[i] - mini > maxi) {
            maxi = v[i] - mini;
            st = prim;
            dr = i;
        }
    }
    g << st << ' ' << dr << ' ' << maxi;
    return 0;
}