#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <climits>

using namespace std;

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

const int MAXN = 50002;

int N, K;
int v[MAXN];
int minim, smax, p, l, r, ans;

int main()
{
    fin >> N >> K;
    ans = INT_MIN;
    p = 0;
    minim = 0;
    for (int i = 1; i <= N; ++i) {
        fin >> v[i];
        v[i] += v[i - 1];

        if (i >= K) {
            if (minim > v[i - K]) {
                minim = v[i - K];
                p = i - K;
            }
            if (ans < v[i] - minim) {
                ans = v[i] - minim;
                l = p + 1;
                r = i;
            }
        }
    }
    fout << l << ' ' << r << ' ' << ans;
    return 0;
}