#include<fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int a[25001];
long long s[25001];
int N,K,p,p2;
int main ()
{
	int i;
	in>>N>>K;
	for(i=1;i<=N;i++)
		in>>a[i],s[i]=a[i]+s[i-1];
	long long maxim = -50000000;
	for(i=K;i<=N;i++)
		if(maxim<s[i])
			maxim=s[i],p=i;
	long long minim  = 5000000;
	for(i=p;i>0;i--)
		if(minim>s[i]&&p-i>=K)
			minim=s[i],p2=i;
	out<<p2+1<<' '<<p<<' '<<maxim-minim;
	return 0;
}