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

using namespace std;

#define DM 50000

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

int n,k,val[DM + 1];
int ans = -1250000009,c1,c2;

void solve() {
    int sum = val[1];
    c1 = 1;

    for(int i = 2; i <= n; i++) {
        if(sum < 0) {
            sum = val[i];
            c1 = i;
        } else {
            sum += val[i];
        }

        if(sum > ans && i - c1 + 1 >= k) {
            ans = sum;
            c2 = i;
        }
    }
}

int main() {
    fin >> n >> k;
    for(int i = 1; i <= n; i++) {
        fin >> val[i];
    }

    solve();

    fout << c1 << " " << c2 << " " << ans;
}