#include<fstream>
#include<limits.h>
using namespace std;
ifstream cin("secv2.in");
ofstream cout("secv2.out");
int S[50005], n;
long long bestSum= -2147000000;
int main()
{
 int  min = INT_MAX, idx=1, beg, end, i, k;
 cin>>n>>k;

 for(i=1;i<=n;i++)
     {cin>>S[i];
      S[i]=S[i]+S[i-1];}
    if(n==k)
    {
        bestSum=0;
        cout<<1<<" "<<n<<" ";
        for(i=1;i<=n;i++)
            smax=smax+v[i];
          
        cout<<smax;
        return 0;
          
          
    }
 for(i=k;i<=n;i++){
     if (bestSum < S[i] - min)
        bestSum = (S[i] - min), beg = idx, end = i;
     if (min > S[i-k])
        min = S[i-k], idx = (i-k+1);
}                            
cout <<  beg << " " << end<<" "<<bestSum <<"\n";
    return 0;
}