#include <fstream>
#include <deque>
#include <vector>
#pragma warning(disable:4996)
using namespace std;

ifstream fin("secv2.in");
ofstream fout("secv2.out");

deque<int> q;

int n, k, s, f;
long long sum, bestsum;

vector <int> v;

int main()
{
	fin >> n >> k;
	v.resize(n);

	for (int i = 0; i < k; ++i)
	{
		fin >> v[i];
		sum += v[i];
		q.push_back(i);
	}
	
	s = 0;
	f = k - 1;
	bestsum = sum;
	
	for (int i = k; i < n; ++i)
	{
		fin >> v[i];
		sum += v[i]; 
		q.push_back(i);
		long long crt = sum - v[q.front()];
		while(q.size() > k && crt >= sum)
		{
			sum = crt;
			q.pop_front();
			crt = sum - v[q.front()];
		}
		if (sum >= bestsum)
		{
			s = q.front();
			bestsum = sum;
			f = q.back();
		}
	}
	
	while (q.size() > k)
	{
		sum -= v[q.front()];
		q.pop_front();
		if (sum >= bestsum)
		{
			bestsum = sum;
			s = q.front();
			f = q.back();
		}
	}

	fout << s + 1 << " " << f + 1 << " " << bestsum << "\n";
	return 0;
}