#include <bits/stdc++.h>
inline int in() {
  int x = 0;
  char c = getchar();
  bool f = false;
  while (c < '0' || c > '9') f |= c == '-', c = getchar();
  while (c >= '0' && c <= '9')
    x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  return f ? -x : x;
}
inline long long lin() {
  long long x = 0;
  char c = getchar();
  bool f = false;
  while (c < '0' || c > '9') f |= c == '-', c = getchar();
  while (c >= '0' && c <= '9')
    x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  return f ? -x : x;
}
const int inf = 0x3f3f3f3f;
int a[1005], b[105], c[105], res;
bool vis[1005], ans[1005];
int main() {
  int n = in(), k = in();
  for (int i = 1; i <= n; ++i) a[i] = in();
  for (int i = 1; i <= k; ++i) b[i] = a[i], c[i] = i;
  int tot = k, min, cnt, r = k + 1, m = 0, x, y;
  while (tot) {
    min = inf, cnt = 0;
    for (int i = 1; i <= k; ++i) {
      if (vis[i]) continue;
      if (min > b[i])
        min = b[i], cnt = 1;
      else if (min == b[i])
        ++cnt;
    }
    x = (int)(100.0 * m / n + 0.5);
    m += cnt;
    y = (int)(100.0 * m / n + 0.5);
    for (int i = 1; i <= k; ++i) {
      if (vis[i]) continue;
      if (b[i] > min) {
        if (x > a[c[i]] - b[i] && x <= a[c[i]] - b[i] + min) ans[c[i]] = true;
        b[i] -= min;
      } else {
        if (x > a[c[i]] - b[i] && x <= a[c[i]]) ans[c[i]] = true;
        if (r <= n)
          c[i] = r, b[i] = a[r++];
        else
          --tot, vis[i] = true;
      }
    }
  }
  for (int i = 1; i <= n; ++i) res += ans[i];
  printf("%d\n", res);
  return 0;
}
