#include <cstdio>
#define NMAX 50005
#define INF 1<<30

using namespace std;

int n,cnt,sum[NMAX],v[NMAX],i,ansP=-INF,ans1,ans2,k,ansN=-INF,ans=-INF,minim=INF,maxim=-INF,pos;


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", &v[i]);
        sum[i]=sum[i-1]+v[i];
    }

    for(i=k;i<=n;i++)
    {
        if(minim>sum[i-k])
        {
            minim = sum[i-k];
            pos = i-k+1;
        }
        if(sum[i]-minim>=ans)
        {
            ans=sum[i]-minim;
            ans1=pos;
            ans2=i;
        }
    }



    printf("%d %d %d", ans1, ans2, ans);
}