#include <stdio.h>
int v[50005],n,k;
long long s[50005];
void read()
{
	int i;
	scanf("%d%d",&n,&k);
	for (i=1; i<=n; i++)
	{
		scanf("%d",&v[i]);
		s[i]=s[i-1]+v[i];
	}
}
void solve()
{
	int st,dr,part,i,j,min,stf,drf;
	long long suma=0;
	suma=s[k];
	st=1;
	dr=k;
	for (i=k; i<=n; i++)
	{
		min=26000;
		for (j=0; j<=i-k; j++)
		{
			if (s[j]<min)
			{
				min=s[j];
				dr=i;
				st=j+1;
			}
		}
		part=s[i]-min;
		if (part>suma)
		{
			suma=part;
			stf=st;
			drf=dr;
		}
	}
	printf("%d %d %d",stf,drf,suma);
}
int main()
{
	freopen("secv2.in","r",stdin);
	freopen("secv2.out","w",stdout);
	read();
	solve();
	return 0;
}