# include <cstdio>
# include <algorithm>
using namespace std;
int a[50001],suma[50001];
int i,j,n,p,u,VV,k,maxx,minn;
long long smax;
int main ()
{
    freopen ("secv2.in", "r", stdin);
    freopen ("secv2.out", "w", stdout);
    scanf ("%d%d", &n, &k);
    for (i=1; i<=n; ++i)
        {
            scanf ("%d", &a[i]);
            suma[i]=suma[i-1]+a[i];
        }
    maxx=suma[k];
    minn=suma[1];
    p=1; u=k;
    for (i=k; i<=n; ++i)
    {
        if (suma[i-k]<minn && suma[i-k]<=0)
                            {
                                minn=suma[i-k];
                                p=i-k+1;
                            }
        VV=suma[i];
        if (minn<=0) VV=suma[i]-minn;
        if (VV>maxx) {
                        maxx=VV;
                        u=i;
                     }
    }
    printf ("%d %d %d\n", p, u, maxx);
    return 0;
}