#include <iostream>
#include <cstdio>
#define MAXN 50050

using namespace std;

int n, k, a[MAXN];
int sum[MAXN], minsum[MAXN];

void citire()
{
    scanf("%d %d", &n, &k);
    for (int i = 1; i <= n; i++)
        scanf("%d", a+i);
}

void pre()
{
    for (int i = 1; i <= n; i++)
        sum[i] = sum[i-1] + a[i];
}

void solve()
{
    int best = 2000000000, maxi = -2000000000, st, stf, dr;
    for (int i = k; i <= n; i++)
    {
        if (sum[i-k] < best)
        {
            best = sum[i-k];
            st = i-k+1;
        }
        if (sum[i] - best > maxi)
        {
            maxi = sum[i]-best;
            stf = st;
            dr = i;
        }
    }
    printf("%d %d %d\n", stf, dr, maxi);
}

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

    citire();
    pre();
    solve();

    return 0;
}