#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, k, index = 0, sum = 0, follower = 0;
  cin >> n >> k;
  long long t[n];
  for (int i = 0; i < n; i = i + 1) {
    cin >> t[i];
  }
  for (int i = 0; i < k; i = i + 1) {
    sum += t[i];
  }
  long long minimum = sum;
  for (long long i = k; i < n; i++, follower++) {
    sum += t[i];
    sum -= t[follower];
    if (minimum > sum) {
      index = follower + 1;
      minimum = sum;
    }
  }
  cout << index + 1;
  return 0;
}
