#include <bits/stdc++.h>
using namespace std;
int main() {
  int i, n, k, max_ending_here = 0, sum;
  cin >> n >> k;
  int a[n];
  for (i = 0; i < n; i = i + 1) {
    cin >> a[i];
  }
  for (i = 0; i < k; i = i + 1) {
    max_ending_here = max_ending_here + a[i];
  }
  int ptr1 = 1, ptr2 = k, x = ptr1;
  sum = max_ending_here;
  while (ptr2 < n) {
    sum = sum + a[ptr2] - a[ptr1 - 1];
    ptr1++;
    ptr2++;
    if (sum < max_ending_here) {
      max_ending_here = sum;
      x = ptr1;
    }
  }
  cout << x << endl;
}
