#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2 * 100 * 1000 + 10, inf = 1e9;
int arr[MAXN];
int sum[MAXN];
int main() {
  int k, n;
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> arr[i];
  }
  for (int i = 1; i <= k; i++) {
    sum[1] += arr[i];
  }
  for (int i = 2; i <= n - k + 1; i++) {
    sum[i] = sum[i - 1] - arr[i - 1] + arr[i + k - 1];
  }
  int minn = inf, ans = 0;
  for (int i = 1; i <= n - k + 1; i++) {
    minn = min(sum[i], minn);
    if (minn == sum[i]) {
      ans = i;
    }
  }
  cout << ans;
}
