#include <bits/stdc++.h>
using namespace std;

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

int n, a[50004], minim = 0, in = 0, st, dr, maxim, k;

int main()
{
    fin >> n >> k;
    for (int i = 1; i <= n; ++i)
    {
        fin >> a[i];
        a[i] += a[i - 1];
    }
    st = 1, dr = k, maxim = a[k];
    for (int i = k + 1; i <= n; ++i)
    {
        if (a[i - k] < minim) minim = a[i - k], in = i - k;
        if (a[i] - minim > maxim)
        {
            maxim = a[i] - minim;
            dr = i;
            st = in + 1;
        }
    }
    fout << st << " " << dr << " " << maxim;
    return 0;
}