#include<iostream>
#include<algorithm>
#include<fstream>
using namespace std;
ifstream fin("karea.in");
ofstream fout("karea.out");
struct node
{
    long long sum,ch;
};
node a[100005];
long long mmin=1<<31;
int main()
{
    //cout<<mmin<<endl;
    long long n,k,i,ans[100002],l,r,in;
    fin>>n>>k;
    fin>>a[1].ch;
    a[1].sum=a[1].ch;
    for(i=2;i<=n;i++)
    {
        fin>>a[i].ch;
        a[i].sum=a[i-1].sum+a[i].ch;
    }
    for(i=1;i<=n;i++)
    {
        l=i-(k+1);
        r=i+k;
        if(l<0)l=0;
        if(r>n)r=n;
        ans[i]=a[r].sum-a[l].sum;
        if(mmin<ans[i])
        {
            mmin=ans[i];
            in=i;
        }
    }
    fout<<in-1<<endl;
	return 0;
}