#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];
    minsum[1] = 1;
    for (int i = 2; i <= n; i++)
        if (sum[i] < sum[minsum[i-1]])
            minsum[i] = i;
        else
            minsum[i] = minsum[i-1];
}

void solve()
{
    int best = -(0x7fffffff), pos;
    for (int i = k; i <= n; i++)
        if (sum[i] - sum[minsum[i-k]] > best)
            pos = i, best = sum[i] - sum[minsum[i-k]];
    printf("%d %d %d\n", minsum[pos-k]+1, pos, sum[pos]-sum[minsum[pos-k]]);
}

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

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

    return 0;
}