#include <iostream>
#include <fstream>

using namespace std;

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

int main()
{
    long int n, k, v[50005], sum[50005], bes, best=-1000000, i1best, i2best, i, minusm, minusi;
    f>>n>>k;
    for (i=0;i<n;i++)
        f>>v[i];
    for (i=0;i<n;i++)
        sum[i]=v[i]+sum[i-1];
    minusm=0;
    minusi=0;
    for (i=k-1;i<n;i++)
    {
        if (sum[i-k]<minusm)
        {
            minusm=sum[i-k];
            minusi=i-k;
        }
        bes=sum[i]-minusm;
        if (best<bes)
        {
            best=bes;
            i1best=minusi;
            i2best=i;
        }
    }
    g<<i1best+2<<' '<<i2best+1<<' '<<best;
    return 0;
}