#include <cstdio>
#include <algorithm>

using namespace std;

int n, k;
int p[50005];
int vmax=-999999999;
int st, fin, ip;

void citire()
{
    int x, vmin=999999999;
    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(vmin>p[i-k])
                ip=i-k+1;
            vmin=min(vmin, p[i-k]);
        }
        if(p[i]-vmin > vmax)
        {
            st=ip;
            fin=i;
            vmax=p[i]-vmin;
        }
    }
}

int main()
{
    freopen("secv2.in", "r", stdin);
    freopen("secv2.out", "w", stdout);
    citire();
    printf("%d %d %d", st, fin, vmax);

    return 0;
}