#include <bits/stdc++.h>
int a[1200], pro[1200], que[1200], jc[1200];
bool ite[1200];
int main() {
  int n, k, f = 1, e = 0, bf, ans = 0, cw = 0;
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; ++i) scanf("%d", &a[i]), que[++e] = i;
  while (true) {
    for (int j = 1; j <= k; ++j)
      if (!pro[j] && f <= e) pro[j] = que[f++], jc[j] = 1;
    bf = (int)floor(100.0 * cw / n + 0.5);
    if (cw == n) break;
    for (int j = 1; j <= k; ++j)
      if (pro[j] && jc[j] == bf && !ite[pro[j]]) ++ans, ite[pro[j]] = true;
    for (int j = 1; j <= k; ++j) {
      if (!pro[j]) continue;
      ++jc[j];
      if (jc[j] > a[pro[j]]) pro[j] = 0, jc[j] = 0, ++cw;
    }
  }
  printf("%d", ans);
  return 0;
}
