#include <bits/stdc++.h>
using namespace std;
long long fun(long long kol, long long n) {
  kol *= 100;
  long long x = kol / n, y = kol % n;
  if (y >= (n + 1) / 2) {
    x++;
  }
  return x;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long i, j, t, mini, q, x, p, z, l, r, y, w, k, sum, kol, n, v, m;
  cin >> n;
  cin >> k;
  vector<long long> a(n), b(n), c(k), d(n);
  sum = 0;
  for (i = 0; i < k; i++) {
    c[i] = -1;
  }
  for (i = 0; i < n; i++) {
    cin >> a[i];
    sum += a[i];
    b[i] = 0;
  }
  l = 0;
  kol = 0;
  while (sum != 0) {
    for (i = 0; i < k; i++) {
      if (c[i] == -1 && l != n) {
        d[l] = 1;
        c[i] = l;
        l++;
      }
    }
    x = fun(kol, n);
    for (i = 0; i < k; i++) {
      if (c[i] != -1) {
        if (d[c[i]] == x) {
          b[c[i]] = 1;
        }
        d[c[i]]++;
        sum--;
        if (d[c[i]] > a[c[i]]) {
          c[i] = -1;
          kol++;
        }
      }
    }
  }
  sum = 0;
  for (i = 0; i < n; i++) {
    sum += b[i];
  }
  cout << sum << endl;
  return 0;
}
