#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f ("secv2.in");
ofstream g ("secv2.out");
int n,k,x,p0,p1;
int main()
{
    f>>n>>k;
    vector<int>v;
    for(int i=1;i<=n;i++)
    {
        f>>x;
        v.push_back(x);
    }
    long long maxs=-99999999;
      while(k<n)
      {

      for(int i=0;i<n-k+1;i++)
        {long long S=0;
            for(int j=0;j<k;j++)
                S=S+v[i+j];
                if(S>maxs)
                maxs=S,p0=i,p1=i+k-1;


        }
        k++;
        }
   g<<p0+1<<" "<<p1+1<<" "<<maxs;
    return 0;
}