#include <fstream>
#define DM 6000000
using namespace std;
ifstream fi ("secv2.in");
ofstream fo ("secv2.out");

long long n, a, s[DM], mn, k;
pair <long long, pair <long long, long long> > mx;

int main()
{
    fi >> n >> k >> a;
    s[0] = a;
    mx.first = -100000;
    for (long long i = 1; i < n; ++i)
    {
        fi >> a;
        s[i] = s[i-1] + a;
        if (s[i] - s[mn] > mx.first && i - mn >= k)
        {
            mx.first = s[i] - s[mn];
            mx.second.first = i;
            mx.second.second = mn;
        }
        if (s[i] < s[mn])
            mn = i;
    }
    fo << mx.second.second + 2 << ' ' << mx.second.first + 1 << ' ' << mx.first;
    return 0;
}