#include <stdio.h>
#include <algorithm>
using namespace std;
#define nmax 50005
#define INF 2000000000

int V[nmax], S[nmax];
int N, K;

int main ()
{
	int i, a, b, minim = INF, maxim = -INF, x;
	freopen("secv2.in","r",stdin);
	freopen("secv2.out","w",stdout);
	scanf("%d%d", &N, &K);
	for (i = 1; i <= N; ++i) { scanf("%d", &x); S[i] = x + S[i-1]; }
	for (i = K; i <= N; ++i)
	{
		if (S[i-K] < minim) { minim = S[i-K]; a = i-K; }
		if (S[i] - S[a] > maxim) { maxim = S[i] - S[a]; b = i; }
	}
	printf("%d %d %d\n", a+1, b, S[b] - S[a]);
	return 0;
}