#include <fstream>

using namespace std;

int n, k;
int s[50001];

int main() {
    ifstream fin("secv2.in");
    ofstream fout("secv2.out");
    
    fin >> n >> k;
    for (int i = 1; i <= n; ++i) { fin >> s[i]; s[i] += s[i-1];}
    
    int minS = 0;
    int pos = 0;
    int bestS = s[k];
    int posS = k;
    for (int i = k + 1; i <= n; ++i) {
        if (s[i-k] < minS) {minS = s[i-k]; pos = i - k;}
        if (s[i] - minS > bestS) {bestS = s[i] - minS; posS = i;}
        }
    fout << pos + 1 << ' ' << posS << ' ' << bestS << '\n';
    return 0;
    }