#include <bits/stdc++.h>
#define ll long long
#define maxn 5e4 + 1

using namespace std;

ifstream fin("secv2.in");
ofstream fout("secv2.out");

int N, K, left, right, max_sum, sum = 0, index = 1;
int v[maxn], sp[maxn];

int main() {
    fin >> n >> n;
    for(int i = 1; i <= k ; i++) {
        fin >> v[i];
        sp[i] = sp[i - 1] + v[i];
    }
    sum = sp[K];
    max_sum = sum;
    left = 1;
    right = k;

    for(int i = k + 1; i <= n; i++) {
        fin >> v[i];
        sp[i] = sp[i - 1] + v[i];
        if(sp[i] - sp[i - k] > sum + v[i]) {
            sum = sp[i] - sp[i - k];
            index = i - k + 1;
        }
        else
            sum += v[i];
        if(sum > max_sum) {
            max_sum = sum;
            left = index;
            right = i;
        }

    }
    fout << left << ' ' << right << ' ' << max_sum;
    return 0;
}