#include <bits/stdc++.h>
const int N = 1010;
int n, k, a[N], a2[N], used[N], m, d, ans;
std::list<int> list;
int t;
void spendTimeUntil(int setSz) {
  while (list.size() > setSz) {
    d = round(100 * (double)m / (double)n);
    for (int x : list) {
      if (a2[x] + 1 == d && !used[x]) {
        used[x] = 1;
        ans++;
      }
    }
    for (auto it = list.begin(); it != list.end();) {
      if (++a2[*it] != a[*it])
        it++;
      else {
        it = list.erase(it);
        m++;
      }
    }
  }
}
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; i++) {
    scanf("%d", a + i);
    if (list.size() < k)
      list.push_back(i);
    else {
      spendTimeUntil(k - 1);
      list.push_back(i);
    }
  }
  spendTimeUntil(0);
  printf("%d\n", ans);
  return 0;
}
