#include<fstream>
#include<deque>
#include<algorithm>
using namespace std;

void read();
void solve();

deque<int > minQ, maxQ;
long long a[50005];
int n, k;
long long maxim = -1000000000000000000LL, minim = 1000000000000000000LL;
int inc, sf;

int main()
{
	read();
	solve();
	return 0;
}

void read()
{
	ifstream fin("secv2.in");
	fin >> n >> k;
	
	int nr;
	for(int i = 1; i <= n; ++i)
	{
		fin >> nr;
		a[i] = a[i-1] + nr;
	}
	
	fin.close();
}

void solve()
{
	ofstream fout("secv2.out");
	
	for(int i = k; i <= n; ++i)
	{
		if( a[i - k] < minim ) 
		{
			minim = a[i - k];
			inc = i - k;
		}
		
		if( a[i] - a[inc] > maxim)
		{
			maxim = a[i] - a[inc];
			sf = i;
		}
	}
		
	fout << inc+1 <<" "<<sf <<" "<< maxim;
	fout.close();
}