#include <bits/stdc++.h>
const int N = 50001;
using namespace std;
ifstream in ("secv2.in");
ofstream out("secv2.out");
long long sp[N], mnp[N];
int n, mx = INT_MIN, a[N], val, ind1, ind2, k;
int main()
{
    in >> n >> k >> a[1];
    val = a[1];
    mnp[1] = 1;
    for (int i = 2; i <= n; i++)
    {
        in >> a[i];
        sp[i] = sp[i - 1] + a[i];
        if (sp[i] < val)
        {
            mnp[i] = i;
            val = sp[i];
        }
        else mnp[i] = mnp[i - 1];
    }
    long long cur;
    for (int i = k; i <= n; i++)
    {
        cur = sp[i] - sp[mnp[i - k + 1]];
        if (cur > mx)
        {
            mx = cur;
            ind1 = mnp[i - k + 1] + 1;
            ind2 = i;
        }
    }
    out << ind1 << " " << ind2 << " " << mx;
    return 0;
}