#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, A[150000 + 5], a = INT_MAX, b = 0, t;
  cin >> n >> k;
  for (int x = 0; x < n; x++) {
    cin >> A[x];
  }
  if (k == 1) {
    cout << distance(A, min_element(A, A + n)) + 1;
  } else {
    for (int x = 0; x <= (n - k); x++) {
      if (!x) {
        t = accumulate(A, A + k, 0);
      } else {
        t = t - A[x - 1] + A[x + k - 1];
      }
      if (t < a) {
        a = t;
        b = x + 1;
      }
    }
    cout << b;
  }
  return 0;
}
