#include <cstdio>
#include <algorithm>
#include <deque>
#define Dim 50002
#define INF 1000000002

using namespace std;
int n, k, val, F, L, Minn;
int Smax = -INF, s[Dim];
deque <int> d;
void read()
{
    freopen("secv2.in", "r", stdin);
    freopen("secv2.out", "w", stdout);
    scanf("%d %d", &n, &k);
    for(int i = 1; i <= n; ++ i)
    {
        scanf("%d", &val);
        if(Smax < val)
        {
            Smax = val;
            F = i;
            L = i;
        }
        s[i] = s[i - 1] + val;
    }
}
void solve()
{
    int i;
    if(k == 1)
    {
        printf("%d %d %d", F, L, Smax);
        exit(0);
    }
    //d.push_back(0);
    for(i = 1; i <= n; ++ i)
    {
        if(i < k)
            continue;
        while(!d.empty() && s[i - k] < s[d.back()])
            d.pop_back();
        d.push_back(i - k);
        if(Smax < s[i] - s[d.front()])
        {
            Smax = s[i] - s[d.front()];
            F = d.front() + 1;
            L = i;
        }
    }
}
void write()
{
    printf("%d %d %d", F, L, Smax);
}
int main()
{
    read();
    solve();
    write();
    return 0;
}