#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  cin >> n >> k;
  int arr[n];
  int ans[n];
  for (int i = 0; i < n; i++) cin >> arr[i];
  int ind = 0;
  ans[0] = 0;
  for (int i = 0; i < k; i++) ans[ind] += arr[i];
  ind++;
  for (int i = 1; i < n; i++) {
    if (ind == (n - k) + 1)
      break;
    else {
      ans[ind] = (ans[i - 1] - arr[i - 1]) + arr[i - 1 + k];
      ind++;
    }
  }
  int min = 0;
  int miner = ans[0];
  for (int i = 1; i <= n - k; i++) {
    if (ans[i] < miner) {
      miner = ans[i];
      min = i + 1;
    } else if (i == n - k)
      break;
  }
  if (min == 0)
    cout << "1";
  else
    cout << min;
}
