#include <fstream>
#define DM 50000
using namespace std;

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

int n, k, v[DM], s[DM], mx, length, start;

int main ()
{
    fi >> n >> k;
    for (int i = 0; i < n; ++i)
    {
        fi >> v[i];
        if (i > 0)
            s[i] = s[i-1] + v[i];
        else
            s[i] = v[i];
    }
    for (int i = k - 1; i < n; ++i)
        for (int j = 0; j <= i - k + 1; ++j)
    {
        if (s[i] - s[j] > mx)
        {
            mx = s[i] - s[j];
            start = j;
            length = i - j;
        }
    }
    fo << start + 2 << ' ' << start + 1 + length << ' ' << mx;
    return 0;
}