#include <fstream>
#include <queue>

#define INF 2e9

using namespace std;

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

int main()
{
    int n, k;
    f >> n >> k;

    queue<int> S;

    int x, sum = 0, inds = 0, inde = -1, smax = -INF, indsm, indem;

    for(int i = 0; i < n; i++)
    {
        f >> x;
        S.push(x);
        sum += x;
        inde++;

        while(!S.empty() && inde - inds >= k && sum - S.front() >= sum)
        {
            sum -= S.front();
            S.pop();
            inds++;
        }

        if(smax < sum && inde - inds + 1 >= k)
        {
            smax = sum;
            indsm = inds;
            indem = inde;
        }

    }

    g << (indsm + 1) << ' ' << (indem + 1) << ' ' << smax << '\n';

    f.close();
    g.close();
    return 0;
}