#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

#define maxN 50005
#define INF 0x3f3f3f3f

int N , K ,aux , st , dr , minim = INF , solC = -INF;
int s[maxN];

int main()
{
	freopen ("secv2.in" , "r" , stdin);
	freopen ("secv2.out" , "w" , stdout);
	
	scanf ("%d %d" , &N , &K);
	
	for (int i = 1 ; i <= N ; ++i)
	{
		int x;
		scanf ("%d" , &x);
		
		s[i] = s[i - 1] + x;
	}
	
	for (int i = K ; i <= N ; ++i)
	{
		if (s[i - K] < minim)
		{
			minim = s[i - K];
			aux = i - K + 1;
		}
		
		if (s[i] - s[aux - 1] > solC)
		{
			solC = s[i] - s[aux - 1];
			
			dr = i;
			st = aux;
		}
	}
	
	printf ("%d %d %d" , st , dr , solC);
	
	return 0;
}