#include<fstream>
#include<algorithm>
using namespace std;

int v[50010], s[50010], m[50010];

ifstream in("secv2.in");
ofstream out("secv2.out");
int N, K;
int main()
{
	in >> N >> K;

	for (int i = 1;i <= N;++i)
		in >> v[i], s[i] += s[i - 1] + v[i];
	m[1] = 1;

	for (int i = 2;i <= N;++i)
		m[i] = (s[m[i - 1]] < s[i]) ? m[i - 1] : i;

	int a = 1, b = K, mx = s[K];

	for (int i = K + 1;i <= N;++i)
	{
		int a1 = 1, b1 = s[1];
		for (int j = 1;j <= i-K;++j)
			if (s[j] < b1)
				b1 = s[j], a1 = j;

		if (s[i] - b1 >= mx)
			mx = s[i] - b1, a = a1 + 1, b = i;

	}

	out << a << " " << b <<" "<< mx;

	return 0;
}