#include <bits/stdc++.h>
using namespace std;
#define int long long
ifstream in ("secv2.in");
ofstream out ("secv2.out");
int v[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)
	{
		if (sum_now + v[i] >= v[i])
		{
			sum_now += v[i];
			if (sum_now > best_sum)
			{
				best_sum = sum_now;
				ind2 = i;
				if (best_sum > best_final && ind2 - ind1 + 1 >= k)
				{
					best_final = best_sum;
					final_1 = ind1;
					final_2 = ind2;
				}
			}
		}
		else
		{
			sum_now = v[i];
			if (sum_now > best_sum)
			{
				best_sum = sum_now;
				ind1 = i;	
				ind2 = i;
			}
		}
	}
	out << ind1 << ' ' << ind2 << ' ' << best_sum;
	return 0;
}