#include <bits/stdc++.h>
using namespace std;
const int maxn = 1005, maxm = 105;
int a[maxn], test[maxn], work[maxm], inter[maxn], n, k, m;
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  int x = min(n, k);
  for (int i = 1; i <= x; i++) work[i] = i;
  int now = x, m = 0, ans = 0;
  while (m < n) {
    int d = floor(100.0 * m / n + 0.5);
    for (int i = 1; i <= k; i++) {
      int cur = work[i];
      if (!cur) continue;
      test[cur]++;
      if (test[cur] == d) inter[cur] = 1;
      if (test[cur] == a[cur]) {
        m++;
        work[i] = ++now;
        if (now > n) work[i] = 0;
      }
    }
  }
  for (int i = 1; i <= n; i++)
    if (inter[i]) ans++;
  printf("%d\n", ans);
  return 0;
}
