#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  scanf("%d %d", &n, &k);
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  int ptr = 0;
  vector<int> stk(k, -1);
  vector<int> progress(k);
  int done = 0;
  vector<int> interesting(n);
  while (true) {
    assert(ptr <= n);
    for (int i = 0; i < k; i++) {
      if (stk[i] > -1 && progress[i] == a[stk[i]]) {
        stk[i] = -1;
        done++;
      }
    }
    if (done == n) {
      break;
    }
    for (int i = 0; i < k; i++) {
      if (stk[i] == -1) {
        if (ptr < n) {
          stk[i] = ptr++;
          progress[i] = 0;
        } else {
          progress[i] = -1;
        }
      }
      assert(stk[i] < n);
      if (progress[i] == -1) {
        assert(stk[i] == -1);
        continue;
      }
      progress[i]++;
      int res = (int)(100.0 * done / n + 0.5);
      if (res == progress[i]) {
        interesting[stk[i]] = 1;
      }
    }
  }
  assert(ptr == n);
  int ans = 0;
  for (int i = 0; i < n; i++) {
    assert(0 <= interesting[i] && interesting[i] <= 1);
    ans += interesting[i];
  }
  printf("%d\n", ans);
  return 0;
}
