#include<bits/stdc++.h>
using namespace std;
long long int arr [500050];
long long int csum_arr [500050];
//long long int temp=0, sum=0; minimum=0;
long long int sum=0,counter=0;
int main ()
{
long long int x=0, k=0;
cin>>x>>k;
for (long long int i=1;i<=x; i++){
cin>>arr[i];
}
///csum ber korbo
for (long long int j=1; j<=x; j++){
csum_arr[j]=arr[j]+csum_arr[j-1];
}
//csum theke desired index ber korbo
//minmum sum er index
long long int temp=INT_MAX;
for (long long int kk=k; kk<=x; kk++){
sum=csum_arr[kk]-csum_arr[kk-k];
if (sum<temp){
temp=sum; //substitution of values
//code ekhan porjonto same
counter=kk;
}
}
cout<<counter<<"\n";
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKbG9uZyBsb25nIGludCBhcnIgWzUwMDA1MF07CmxvbmcgbG9uZyBpbnQgY3N1bV9hcnIgWzUwMDA1MF07Ci8vbG9uZyBsb25nIGludCB0ZW1wPTAsIHN1bT0wOyBtaW5pbXVtPTA7CmxvbmcgbG9uZyBpbnQgc3VtPTAsY291bnRlcj0wOwppbnQgbWFpbiAoKQp7CgogICBsb25nIGxvbmcgaW50IHg9MCwgaz0wOwogICAgY2luPj54Pj5rOwogICAgZm9yIChsb25nIGxvbmcgaW50IGk9MTtpPD14OyBpKyspewogICAgICAgIGNpbj4+YXJyW2ldOwogICAgfQogICAgLy8vY3N1bSBiZXIga29yYm8KICAgIGZvciAobG9uZyBsb25nIGludCBqPTE7IGo8PXg7IGorKyl7CiAgICAgICAgY3N1bV9hcnJbal09YXJyW2pdK2NzdW1fYXJyW2otMV07CiAgICB9CiAgICAvL2NzdW0gdGhla2UgZGVzaXJlZCBpbmRleCBiZXIga29yYm8KICAgIC8vbWlubXVtIHN1bSBlciBpbmRleAogICAgbG9uZyBsb25nIGludCB0ZW1wPUlOVF9NQVg7CiAgICBmb3IgKGxvbmcgbG9uZyBpbnQga2s9azsga2s8PXg7IGtrKyspewogICAgICAgIHN1bT1jc3VtX2Fycltra10tY3N1bV9hcnJba2sta107CiAgICAgICAgaWYgKHN1bTx0ZW1wKXsKICAgICAgICAgICAgdGVtcD1zdW07IC8vc3Vic3RpdHV0aW9uIG9mIHZhbHVlcwogICAgICAgICAgICAvL2NvZGUgZWtoYW4gcG9yam9udG8gc2FtZQogICAgICAgICAgICBjb3VudGVyPWtrOwogICAgICAgIH0KCiAgICB9CiAgICBjb3V0PDxjb3VudGVyPDwiXG4iOwogICAgcmV0dXJuIDA7Cn0=