#include<cstdio>
#include<deque>
#define oo 1<<30
using namespace std;
deque<int> p;
int n,k,s[50010],i,j,a,best,besti,bestj,t;
int main()
{
    freopen("secv2.in","r",stdin);
    freopen("secv2.out","w",stdout);
    scanf("%d %d",&n,&k);
    best=-oo;
    for(i=1;i<=n;i++)
    {
        scanf("%d",&a);
        s[i]=s[i-1]+a;
        if(i>=k&&best<s[i]) {best=s[i]; bestj=i;}
    }
    best=-oo;
    for(i=bestj-k;i>=1;i--)
    {
        t=s[bestj]-s[i-1];
        if(t>best) {best=t; besti=i;}
    }
    printf("%d %d %d\n",besti,bestj,best);
    return 0;
}