#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, rez = 0, pom, d[200010], s = 1;
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> d[i];
  for (int i = 0; i < k; i++) rez += d[i];
  pom = rez;
  for (int i = k; i < n; i++) {
    pom += d[i] - d[i - k];
    if (pom < rez) {
      rez = pom;
      s = i - k + 2;
    }
  }
  cout << s;
  return 0;
}
