#include <fstream>
#include <climits>
#include <iostream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int v[50005];
int main()
{
    int N, k;
    fin >> N >> k;
    int sum = 0, maxSum = INT_MIN, st = 1, maxst, dr, sumUltimeleK = 0;
    for (int i = 1; i <= N; i++)
    {
        int nr;
        fin >> v[i];
        sum += v[i];
        sumUltimeleK += v[i];
        if(i >= k) {
            sumUltimeleK -= v[i - k];
            if (sum < sumUltimeleK) {
                sum = sumUltimeleK; // pastram doar ultimele k
                st = i - k + 1;
            }
            if (sum > maxSum) {
                maxst = st;
                dr = i;
                maxSum = sum;
            }
        }
    }
    fout << maxst << " " << dr  << " "  << maxSum;
    return 0;
}