#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (!a) return b;
  return (gcd(b % a, a));
}
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> fence(n);
  for (int i = 0; i < n; i++) {
    cin >> fence[i];
  }
  int total = 0;
  for (int i = 0; i < k; i++) {
    total += fence[i];
  }
  int mintotal = total;
  int minindex = 0;
  int l = 0, r = k;
  while (r < n) {
    total -= fence[l];
    total += fence[r];
    l++;
    r++;
    if (mintotal > total) {
      mintotal = total;
      minindex = l;
    }
  }
  cout << minindex + 1 << endl;
}
