#include <bits/stdc++.h>
using namespace std;
int n, k;
int a[3003];
int used[3002];
int start[3002];
int en[3002];
int idx[3002];
int cot[3002];
int main() {
  scanf("%d%d", &n, &k);
  int id = 0;
  int cnt = 0;
  int ans = 0;
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  memset(en, -1, sizeof(en));
  for (int i = 0; i <= n * 150; i++) {
    for (int j = 1; j <= k; j++)
      if (used[j] && en[j] <= i) {
        used[j] = 0;
        en[j] = 0;
        cnt++;
      }
    for (int j = 1; j <= k; j++)
      if (!used[j]) {
        id++;
        if (id > n) break;
        used[j] = 1;
        start[j] = i;
        en[j] = i + a[id];
        idx[j] = id;
      }
    int per = (int)((double)cnt * 100.0 / n + 0.5);
    for (int j = 1; j <= k; j++)
      if (used[j] && cot[idx[j]] == 0) {
        int perj = (int)(a[idx[j]] - (en[j] - i) + 1);
        if (perj == per) {
          ans++;
          cot[idx[j]] = 1;
        }
      }
  }
  printf("%d\n", ans);
  return 0;
}
