#include <bits/stdc++.h>
using namespace std;
#define int long long
ifstream in ("secv2.in");
ofstream out ("secv2.out");
int v[50001];
int sume[50001];
int ind1 = 0, ind2 = 0, sum_now = 0, best_sum = 0;
int final_1, final_2, best_final;
main ()
{
	int n, k;
	in >> n >> k;
	for (int i = 1;i<=n;++i)
		in >> v[i];
	for (int i = 1;i<=n;++i)
		sume[i] = sume[i-1] + v[i];
	int poz_for_sum = 1;
	int sum = v[1];
	int poz = 0;
	int max_sum = 0;
	for (int i = k - 1;i<=n;++i)
	{
		if (sum > sume[i - k + 1])
		{
			poz_for_sum = i - k + 1;
			sum = sume[i-k];
		}
		if (sume[i] - sum > max_sum)
		{
			poz = i;
			max_sum = sume[i] - sum;
		}
	}
	out << poz_for_sum << ' ' << poz << ' ' << max_sum;
	return 0;
}