#include <bits/stdc++.h>
using namespace std;
int a [2000005], n, k;
int main (){

	ifstream fin ("karea.in");
	ofstream fout ("karea.out");
	fin >> n >> k;
	for (int i = 0; i < n; i ++){
        int q;
        fin >> q;
        a [i + k + 1] = a [i + k] + q;
	}
	int x = a [n + k];
	for (int i = n + k + 1; i < 2000004; i ++) a [i] = x;
	int maxsum = -2000000000, maxind = 0;
	for (int i = 0; i < n; i ++){
        int q = a [i + 2 * k + 1] - a [i];
        if (q > maxsum){
            maxsum = q;
            maxind = i;
        }
	}
	fout << maxind << endl;

return 0;
}