#include <iostream>
#include <fstream>
#include <climits>
#include <vector>
using namespace std;

ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n, k, p, q; long long summax=LLONG_MIN;
vector<int> v;
vector<long long> s;

int main()
{
    fin>>n>>k;
    v.resize(n+1);
    s.resize(n+1);
    for (int i=1; i<=n; i++){
        fin>>v[i];
    }
    s[0]=0;
    for (int i=1; i<=n; i++){
        s[i]=v[i]+s[i-1];
    }
    
    for (int i=1; i<=n-k-1; i++){
        int curres;
        for (int j=i+k-1; j<=n; j++){
            curres=s[j]-s[i-1];
            if (curres>summax){
                p=i; q=j; summax=curres;
            }
        }
    }
    
    fout<<p<<" "<<q<<" "<<summax;

    return 0;
}