#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");

int v[500001];

int main() {
    long long n, k, maxim = 0, poz;
    fin >> n >> k;
    for (int i = 1; i <= n; ++i) {
        fin >> v[i];
        v[i] += v[i - 1];
        if (i == k || (i > k && v[i] > maxim)) {
            maxim = v[i];
            poz = i;
        }
    }
    int minim = 2500000, p;
    for (int i = 1; i <= poz - k; ++i) {
        if (v[i] < minim) {
            minim = v[i];
            p = i + 1;
        }
    }
    fout << p << " " << poz << " " << maxim - minim;
    return 0;
}