#include <fstream>

using namespace std;

int N,K,s[50001],v[50001];
void read_data();
void solve();

int main()
{
	read_data();
	solve();
	return 0;
}

void read_data()
{
	ifstream f("secv2.in");
	f >> N >> K;
	for (int i = 1 ; i <= N ; ++i)
		f >> v[i];
	f.close();
}

void solve()
{
	ofstream g("secv2.out");
	int max = -1999999999,first,last;
	for (int i = 1 ; i <= N ; ++i)
	{
		s[i] = s[i - 1] + v[i];
	}
	int min = 1999999999,current = 0;
	if (s[K] > max)
	{
		max = s[K];
		first = 1;
		last = K;
	}
	for (int i = K + 1 ; i <= N ; ++i)
	{
		if (s[i - K] < min)
		{
			min = s[i - K];
			current = i - K + 1;
		}
		if (s[i] - min > max)
		{
			max = s[i] - min;
			first = current;
			if (!first)
				first++;
			last = i;
		}
	}
	g << first << " " << last << " " << max << endl;

}