#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000 + 10;
struct Node {
  int time, a, pos;
};
int num[maxn];
int visit[maxn];
vector<Node> vec;
vector<Node>::iterator it;
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  int cnt = 0;
  for (int i = 0; i < n; i++) scanf("%d", &num[i]);
  Node node;
  for (int i = 0; i < k && i < n; i++) {
    node.time = 0;
    node.a = num[i];
    node.pos = i;
    vec.push_back(node);
    cnt++;
  }
  int ans = 0;
  int m = 0;
  while (!vec.empty()) {
    for (it = vec.begin(); it != vec.end(); it++) {
      (*it).time++;
      int q = int(m * 1.0 / n * 100 + 0.5);
      if (q == (*it).time && !visit[(*it).pos]) {
        ans++;
        visit[(*it).pos] = 1;
      }
    }
    for (it = vec.begin(); it != vec.end();) {
      if ((*it).time == (*it).a) {
        m++;
        if (cnt < n) {
          (*it).time = 0;
          (*it).pos = cnt;
          (*it).a = num[cnt++];
          it++;
        } else {
          vec.erase(it);
        }
      } else
        it++;
    }
  }
  printf("%d\n", ans);
  return 0;
}
