#include <bits/stdc++.h>
using namespace std;
void FastInputOutput() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
long long binaryToDecimal(string n) {
  string num = n;
  long long dec_value = 0;
  int base = 1;
  int len = num.length();
  for (int i = len - 1; i >= 0; i--) {
    if (num[i] == '1') dec_value += base;
    base = base * 2;
  }
  return dec_value;
}
std::string toBinary(long long n) {
  std::string r;
  while (n != 0) {
    r = (n % 2 == 0 ? "0" : "1") + r;
    n /= 2;
  }
  return r;
}
string ToString(unsigned long long i) {
  ostringstream oss;
  oss << i;
  return oss.str();
}
std::string remove_char(std::string str, char ch) {
  str.erase(std::remove(str.begin(), str.end(), ch), str.end());
  return str;
}
bool isPrime(int n) {
  if (n <= 1) return false;
  for (int i = 2; i < n; i++)
    if (n % i == 0) return false;
  return true;
}
int minSum(int arr[], int n, int k) {
  int res = 0, id = 0;
  int maxx = INT_MAX;
  for (int i = 0; i < n - k; i++) {
    for (int j = i; j < i + k; j++) {
      res += arr[j];
    }
    if (res < maxx) {
      maxx = res;
      id = i + 1;
    }
    res = 0;
  }
  return id + 1;
}
int main() {
  FastInputOutput();
  string LETTRES = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
  string cons = "bcdfghjklmnpqrstvxzt";
  string vowel = "aoyeui";
  int n, m, pos = 0, t = 15000001;
  cin >> n >> m;
  int arr[n];
  arr[0] = 0;
  for (int i = 1; i <= n; i++) {
    cin >> arr[i];
    arr[i] += arr[i - 1];
  }
  for (int i = m; i <= n; i++) {
    if (t > arr[i] - arr[i - m]) {
      t = arr[i] - arr[i - m];
      pos = i;
    }
  }
  cout << pos - m + 1;
  return 0;
}
