#include <iostream> 
#include <fstream>
#include <iomanip>
#include <cmath>
#include <algorithm> 
#include <cstring>

using namespace std;

string NumeFisier = "secv";

ifstream fin(NumeFisier + ".in");
ofstream fout(NumeFisier + ".out");

typedef unsigned long long int ull;

int main()
{
	int n, k, v[50001] = { 0 };
	fin >> n >> k;

	for (int i = 1; i <= n; i++)
		fin >> v[i];

	for (int i = 1; i <= n; i++)
		v[i] += v[i - 1];

	int sumMax = -2147483647 - 1;
	int left = 1;
	int right = 1;
	for (int i = 1; i <= n - k + 1; i++)
		for (int j = i + k - 1; j <= n; j++)
		{
			if (v[j] - v[i - 1] > sumMax)
			{
				left = i;
				right = j;
				sumMax = v[j] - v[i - 1];
			}
		}
	fout << left << " " << right << " " << sumMax;
}