#include<fstream>
#define maxn 50001

using namespace std;

ifstream f("secv2.in");
ofstream g("secv2.out");

int a[maxn],i,m,k,n,t,p,q,pf;

int main()
{
    f>>n>>k;

    for(i=1;i<=n;++i)
    {
        f>>m;
        a[i]=a[i-1]+m;
    }

    m=0;
    t=-0x3f3f3f3f;
    pf=1;
    q=k;

    for(i=k;i<=n;++i)
    {
        if(a[i]-m>t) t=a[i]-m,q=i,pf=p;
        if(a[i-k+1]<m) m=a[i-k+1],p=i-k+2;
    }

    g<<pf<<" "<<q<<" "<<t<<"\n";

    f.close();
    g.close();

    return 0;
}