#include <bits/stdc++.h>

using namespace std;
ifstream r("secv2.in");
ofstream w("secv2.out");

deque<int>dq;
int ans = -1e9, s[50003], n, k, l, ri;

int main()
{
    ios_base::sync_with_stdio(false);
    r.tie(NULL);
    r >> n >> k;
    for (int i=1; i<=n; i++)
    {
        int x;
        r >> x;
        s[i] = s[i - 1] + x;
    }
    for (int i=k; i<=n; i++)
    {
        while (dq.empty() == false && s[dq.front()] >= s[i - k])
        {
            dq.pop_front();
        }
        dq.push_front(i - k);
        if (s[i] - s[dq.back()] > ans)
        {
            ans = s[i] - s[dq.back()];
            l = dq.back();
            ri = i;
        }
    }
    w << l + 1 << " " << ri << " " << ans;
}