#include <iostream>
#include <fstream>
#include <deque>
#include <list>
using namespace std;

// Secv2

int main() {
	freopen("deque.in", "r", stdin);
	freopen("deque.out", "w", stdout);
	
	int n, m, i, j, v[50010] = { 0 };
	scanf("%d %d ", &n, &m);
	for (i = 1; i <= n; i++) {
		cin >> v[i];
		v[i] += v[i - 1];
	}

	int maxim = v[n], sm = 1, fm = n;
	for (i = 1; i <= n; i++) {
		for (j = i + m - 1; j <= n; j++) {
			if (v[j] - v[i - 1] > maxim) {
				maxim = v[j] - v[i - 1];
				sm = i;
				fm = j;
			}
		}
	}
	printf("%d %d %d", sm, fm, maxim);
	return 0;
}