#include <bits/stdc++.h>
using namespace std;
int a[1010], b[1010] = {}, c[1010];
bool f[1010];
set<int> s;
int main() {
  int i, j, n, k, l, e = 0, ans = 0;
  cin >> n >> k;
  for (i = 0; i < n; i++) {
    cin >> a[i];
    f[i] = false;
  }
  for (i = 0; i < n; i++) {
    double x = i, y = n;
    c[i] = (int)((double)100 * x / y + 0.5);
  }
  for (i = 0; i < k; i++) {
    s.insert(i);
  }
  int nex = k;
  for (i = 0; i <= 150010; i++) {
    if (s.size() == 0) break;
    for (j = 0; j < 2; j++) {
      if (j == 0) {
        auto it = s.begin();
        while (it != s.end()) {
          int y = *it;
          if (c[e] == b[y] + 1) {
            f[y] = true;
          }
          it++;
        }
      }
      if (j == 1) {
        vector<int> v;
        auto it = s.begin();
        while (it != s.end()) {
          int y = *it;
          b[y]++;
          v.push_back(y);
          it++;
        }
        for (l = 0; l < v.size(); l++) {
          if (b[v[l]] == a[v[l]]) {
            s.erase(v[l]);
            e++;
            if (nex < n) {
              s.insert(nex);
              nex++;
            }
          }
        }
      }
    }
  }
  for (i = 0; i < n; i++) {
    if (f[i]) ans++;
  }
  cout << ans << endl;
}
