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

const int oo = 0x3f3f3f3f;

class InParser
{
private:
	FILE* fin;
	char* buff;
	int sp;
	char read()
	{
		++sp;
		if (sp == 4096)
		{
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}
public:
	InParser(const char* nume)
	{
		sp = 4095;
		buff = new char[4096];
		fin = fopen(nume, "r");
	}
	InParser& operator >> (int& n)
	{
		char c;
		int sgn = 1;
		while (!isdigit(c = read()) && c != '-');
		if (c == '-')
		{
			sgn = -1;
			n = 0;
		}
		else n = c - '0';
		while (isdigit(c = read()))
			n = n * 10 + c - '0';
		n *= sgn;
		return *this;
	}
};

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

deque<int> q;

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

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]; 
		int crt = sum - v[q.front()];
		if (crt >= sum)
		{
			sum = crt;
			q.pop_front();
		}
		q.push_back(i);
		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;
}