#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 10;
int a[MAXN], b[MAXN], c[MAXN], vis[MAXN];
int main() {
  int n, k;
  int t = 0, d, ans = 0;
  scanf("%d %d", &n, &k);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  for (int i = 1; i <= k; i++) {
    b[i] = a[i];
  }
  d = k + 1;
  while (t < n) {
    int q = t * 100.0 / n + 0.5;
    for (int i = 1; i <= k; i++) {
      if (b[i]) {
        c[i]++;
        if (c[i] == q && !vis[i]) ans++, vis[i] = 1;
        if (c[i] >= b[i]) {
          vis[i] = 0;
          c[i] = 0;
          b[i] = a[d];
          d++;
          t++;
        }
      }
    }
  }
  printf("%d\n", ans);
}
