#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
  ll n, k;
  cin >> n >> k;
  vector<ll> v(n);
  ll sum[n];
  for (ll i = 0; i < n; i++) cin >> v[i];
  partial_sum((v).begin(), (v).end(), sum);
  ll mx = 0;
  ll mxval = sum[k - 1];
  for (ll i = 1; i < n - k + 1; i++) {
    ll cur = sum[i + k - 1];
    cur -= sum[i - 1];
    if (cur < mxval) mxval = cur, mx = i;
  }
  cout << mx + 1 << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  ll t = 1;
  while (t--) {
    solve();
  }
}
