#define vmax 999999999
#include <cstdio>
#include <algorithm>
using namespace std;
int p[50001], n, k;

int istart, ifin, sum = -vmax;
int ip, ifp, sp;
void fc()
{
    int x, mins = vmax;
    scanf("%d %d", &n, &k);
    for(int i=1; i<=n; ++i)
    {
        scanf("%d", &x);
        p[i] = p[i-1] + x;
        if(i >= k){
            if(mins > p[i-k])
                ip = i-k+1;
            mins = min(mins, p[i-k]);
        }
        if(p[i] - mins > sum){
            istart = ip;
            ifin = i;
            sum = p[i]-mins;

        }
    }
    printf("%d %d %d", istart, ifin, sum);
}


int main()
{
    freopen("secv2.in", "r", stdin);
    freopen("secv2.out", "w", stdout);
    fc();
    return 0;
}