#include <bits/stdc++.h>
using namespace std;
struct S {
  int x, num;
} a[1010], b[1010];
int vis[1010] = {0};
vector<S> v, vv;
int main() {
  int n, k, i;
  cin >> n >> k;
  for (i = 0; i < n; i++) {
    cin >> a[i].x;
    a[i].num = i;
    b[i].x = 0;
    b[i].num = i;
  }
  for (i = 0; i < min(k, n); i++) {
    v.push_back(a[i]);
    vv.push_back(b[i]);
  }
  int pos = min(k, n);
  int ans = 0;
  while (!v.empty()) {
    int cc = pos - v.size();
    int d = floor(cc * 100.0 / n + 0.5);
    for (i = 0; i < v.size(); i++) {
      vv[i].x++;
      if (vv[i].x == d && vis[vv[i].num] == 0) {
        vis[vv[i].num] = 1;
        ans++;
      }
    }
    for (i = 0; i < v.size();) {
      if (vv[i].x == v[i].x) {
        v.erase(v.begin() + i);
        vv.erase(vv.begin() + i);
      } else
        i++;
    }
    while (v.size() < k && pos < n) {
      v.push_back(a[pos]);
      vv.push_back(b[pos]);
      pos++;
    }
  }
  cout << ans << endl;
}
