#include <bits/stdc++.h>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int n,L,U,a[100005];
priority_queue <pair<int,int>> q;
int main()
{int i,k,fin=-1000000000,maxst,maxdr;
    in>>n>>L;
    for (i=1;i<=n;i++)in>>a[i];
    for (i=1;i<=n;i++)a[i]=a[i-1]+a[i];
    for (i=0;i<=n-L;i++)
    {
        q.push({-a[i],i});
        if (a[i+L]+q.top().first>fin)
            fin=a[i+L]+q.top().first,
            maxst=q.top().second+1,
            maxdr=i+L;
    }
    out<<maxst<<" "<<maxdr<<" "<<fin<<"\n";
    out.close();
    in.close();
    return 0;
}