#include <fstream>
#include <iostream>
#define NM 50005
#define INF 0x3f3f3f3f

using namespace std;

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

int v[NM], n, k;

inline int max(int a, int b)
{
    return a > b ? a : b;
}

int main()
{
    int st = 1, indx = 1 , dr , best, sum = 0;
    f >> n >> k;
    for(int i = 1; i <= n; ++i)
        f >> v[i];
    if(k == n)
    {
        for(int i = 1; i <= n; ++i)
            sum += v[i];
        g << 1 << ' ' << n << ' ' << sum;
        f.close();
        return 0;
    }
    best = -INF;
    for(int i = 1; i <= n; ++i)
    {
        if(sum < 0)
            sum = v[i], indx = i;
        else sum += v[i];
        if(sum > best && i - indx  + 1 >= k)
        {
            best = sum;
            dr = i;
            st = indx;
        }
    }
    g << st << ' ' << dr << ' ' << best << '\n';
    f.close(); g.close();

}