#include<bits/stdc++.h>
using namespace std;
long long n,k,a[2000010],s[2000010],ans1,ans2;
int main() {
	scanf ("%lld%lld",&n,&k);
	for (int i = 1; i <= n; i++) {
		scanf ("%lld",&a[i]);
		s[i] = s[i-1]+a[i] ;
	}
	for (int i = n + 1; i <= n + n; i++) {
		s[i] = s[i - 1] + a[i - n];
	}
	for (int i = 1; i+k-1 <= n+n; i++) {
		if (s[i+k-1] - s[i-1] > ans1) {
			ans1 = s[i + k - 1] - s[i - 1];
			ans2 = i;
		}
	}
	cout << ans1 << endl << ans2;
	return 0;
}