#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7, M = 1e7, OO = 0x3f3f3f3f;
const long long MOD = 2e9 + 7;
int main() {
  int n, k, arr[150000 + 7];
  scanf("%d %d", &n, &k);
  for (int i = 0; i < int(n); ++i) scanf("%d", &arr[i]);
  int pos = 1, sum = 0;
  for (int i = 0; i < int(k); ++i) sum += arr[i];
  int Min = sum;
  int f = 0, l = k, a;
  while (l < n) {
    sum -= arr[f];
    sum += arr[l];
    if (Min > sum) {
      Min = sum;
      pos = f + 2;
    }
    f++;
    l++;
  }
  cout << pos;
  return 0;
}
