#include <fstream>
#include <algorithm>
#include <cmath>
using namespace std;
ifstream cin("secv2.in");
ofstream cout("secv2.out");
 
int a[50005], i, j, k, best, sol, x, n, pre=0, act, t, y, s1, x1;
 
 
int main()
{
	
	cin>>n>>k;

	for (i=1; i<=n; ++i)
		cin>>a[i];
		
	for (i=1; i<=k; ++i)
		pre+=a[i];
		
	sol=s1=pre;
	x=1; y=k; x1=1;
	
	for (i=k+1; i<=n; ++i)
	{
		pre=pre+a[i]-a[i-k];
		
		if (s1+a[i]<pre)
		{
			s1=pre;
			x=i-k+1;
		}
		else s1+=a[i];
		
		if (s1>sol)
		{
			sol=s1;
			x1=x;
			y=i;
		}
				
	}
	
	cout<<x1<<' '<<y<<' '<<sol;

    return 0;
}