#include <bits/stdc++.h>

using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n, k, sp[50010];
deque<int> dq;

int main()
{
    fin >> n >> k;
    for(int i=1; i<=n; i++) {
        int x; fin >> x;
        sp[i] = sp[i - 1] + x;
    }
    int maxim = -2e9, st, dr;
    for(int i=k; i<=n; i++) {
        while(!dq.empty() && sp[i] - sp[i - k] >= sp[i] - sp[dq.back()]) dq.pop_back();
        dq.push_back(i - k);
        if(sp[i] - sp[dq.front()] > maxim) maxim = sp[i] - sp[dq.front()], st = dq.front() + 1, dr = i;
    }
    fout << st << " " << dr << " " << maxim;

    return 0;
}