#include <bits/stdc++.h>
const int N = 200005;
int a[N], b[N], ok[N], start[N];
int main() {
  int n, k, m = 0, ans = 0, fm = 0;
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int t = 0; t <= 150 * n; t++) {
    for (int i = 1; i <= k; i++)
      if (b[i] == t) {
        if (m < n) {
          b[i] = a[++m] + t;
          start[m] = t;
        }
        if (t) fm++;
      }
    ok[t] = fm;
  }
  for (int i = 1; i <= n; i++) {
    for (int j = start[i]; j < start[i] + a[i]; j++) {
      int x = j - start[i] + 1;
      int y = int(100.0 * ok[j] / n + 0.5);
      if (x == y) {
        ans++;
        break;
      }
    }
  }
  printf("%d\n", ans);
  return 0;
}
