#include <bits/stdc++.h>

using namespace std;

ifstream f("secv2.in");
ofstream g("secv2.out");
int64_t v[50005],ans=-1e16,n,k,i1,j1;
deque <int> Q;
int main()
{
    f>>n>>k;
    for(int i=1; i<=n; i++)
        f>>v[i],v[i]+=v[i-1];
    for(int i=1; i<=n; i++)
    {
        if(i<=k)
            continue;
        while(!Q.empty()&&v[Q.back()]>=v[i-k])
            Q.pop_back();
        Q.push_back(i-k);
        if(Q[0]<i-n)
            Q.pop_front();
        if(ans<v[i]-v[Q[0]])
            i1=Q[0]+1,j1=i,ans=v[i]-v[Q[0]];
    }
    g<<i1<<' '<<j1<<' '<<ans;

    return 0;
}