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

#define ll long long int
#define MAX 50001

using namespace std;

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

ll a[MAX], n, k, x, maxim = 0, s, d;

int main() {
	in >> n >> k;
	a[0] = 0;
	for (int i = 1; i <= n; i++) in >> x, a[i] = a[i - 1] + x;
	for (int st = 1; st <= n; st++) {
		for (int dr = k + st - 1; dr <= n; dr++) {
			if (a[dr] - a[st - 1] > maxim)maxim = a[dr] - a[st - 1], s = st, d = dr;
		}
	}
	out << s << " " << d << " " << maxim;
	
}