#include <bits/stdc++.h>
using namespace std;
long long int md = 1e9 + 7;
const int N = 1e6;
long long int n, k, vis[N], des[N];
vector<long long int> v, se;
long double _time = 0;
int main() {
  cin >> n >> k;
  v.resize(n), se.resize(n);
  for (int i = 0; i < n; i++) cin >> v[i];
  long long int p = min(k, n);
  long long int c = 0;
  long long int ans = 0;
  while (true) {
    long long int nowC = 0;
    long long int plus = 0;
    for (int i = 0; i < p; i++) {
      se[i]++;
      if ((se[i] == _time) && (!vis[i]) && (!des[i])) ans++, des[i] = 1;
      if ((se[i] == v[i]) && (!vis[i])) nowC++, vis[i] = 1, plus++;
    }
    p += min(plus, k);
    p = min(p, n);
    c += nowC;
    _time = round(100 * ((1.0 * c) / n));
    if (c == n) break;
  }
  cout << ans;
}
