#include <iostream>
#include <fstream>

using namespace std;

ifstream in("ssm.in");
ofstream out("ssm.out");

const int kNMax = 6000000;

int v[kNMax + 1];
int sp[kNMax + 1];

int main() {
    int n;
     in >> n >> k;
    for (int i = 1; i <= n; i++) {
        in >> v[i];
    }

    for (int i = 1; i <= n; i++) {
        sp[i] = sp[i - 1] + v[i];
    }

    int sum_max = v[1], l_max = 1, r_max = 1;
    int val_min = 0, poz_min = 0;

    for (int j = 1; j <= n; j++) {
        int sum_curr = sp[j] - val_min;

        if (sum_curr > sum_max) {
            if(r_max - l_max + 1 == k)
            sum_max = sum_curr;
            l_max = poz_min + 1;
            r_max = j;
        }
        if (val_min > sp[j]) {
            val_min = sp[j];
            poz_min = j;
        }


    }

    out << sum_max << " " << l_max << " " << r_max << "\n";
    return 0;
}