#include <bits/stdc++.h>
template <typename T>
T GCD(T a, T b) {
  return a ? GCD(b % a, a) : b;
}
template <typename T>
T LCM(T a, T b) {
  return (a * b) / GCD(a, b);
}
using ld = double;
using ll = long long int;
using ul = unsigned long long int;
using namespace std;
class BFence {
 public:
  void solve(std::istream &in, std::ostream &out) {
    int n, kk, mini = 2e9 + 17, minIndex;
    in >> n >> kk;
    int a[n + 1];
    a[0] = 0;
    for (int i = 1; i < n + 1; i++) {
      int b;
      in >> b;
      if (i == 1)
        a[i] = b;
      else
        a[i] = b + a[i - 1];
    }
    if (n == kk) {
      out << 1 << endl;
      return;
    }
    for (int k = n + 1 - 1; k >= 1; k--) {
      if (k - kk < 0) break;
      int diff = a[k] - a[k - kk];
      if (diff < mini) {
        mini = diff;
        minIndex = k - kk + 1;
      }
    }
    out << minIndex << endl;
  }
};
int main() {
  std::ios_base::sync_with_stdio(0);
  std::cin.tie(nullptr);
  BFence solver;
  std::istream &in(std::cin);
  std::ostream &out(std::cout);
  solver.solve(in, out);
  return 0;
}
