#include <bits/stdc++.h>
using namespace std;
const int sizes = 2000001;
long long int tim[sizes], start[sizes];
int main() {
  long long int i, j, k, l, m, n, o, p, q, r, s, t, a[2000];
  cin >> n >> k;
  for (i = 0; i < n; i++) {
    cin >> a[i];
  }
  multiset<long long int> se;
  long long int done = 0;
  long long int index = 0;
  for (i = 0; i <= 1500000; i++) {
    while (!se.empty() && *(se.begin()) <= i) {
      done++;
      se.erase(se.begin());
    }
    while (se.size() < k && index < n) {
      start[index] = i;
      se.insert(a[index] + i);
      index++;
    }
    long double x = (100.0 * done) / n;
    x = floor(x + 0.5);
    tim[i] = x;
  }
  long long int ans = 0;
  for (i = 0; i < n; i++) {
    for (j = 1; j <= a[i]; j++) {
      long long int x = start[i];
      x += j;
      if (tim[x - 1] == j) {
        ans++;
        break;
      }
    }
  }
  cout << ans << endl;
  return 0;
}
