#include <bits/stdc++.h>
using namespace std;
long long get_per(long long m, long long n) {
  double x = 100.00 * double(m);
  x /= double(n);
  x = x + 0.5;
  return floor(x);
}
void solve(long long tc) {
  long long n, k;
  cin >> n >> k;
  multiset<long long> process;
  for (long long i = 1; i <= k; i++) process.insert(0);
  vector<array<long long, 3> > run_time(n);
  vector<long long> a(n);
  vector<long long> en_time(1000005);
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    auto it = process.begin();
    long long st = *it;
    long long en = st + a[i];
    process.erase(it);
    process.insert(en);
    en_time[en]++;
    run_time[i] = {en, st, i};
  }
  sort((run_time).begin(), (run_time).end());
  long long en_max = run_time[n - 1][0];
  long long ans = 0;
  long long cs = 0;
  for (long long i = 0; i <= en_max; i++) {
    cs += en_time[i];
    en_time[i] = get_per(cs, n);
  }
  for (long long i = 0; i < n; i++) {
    long long f = 0;
    long long st = run_time[i][1];
    long long en = run_time[i][0];
    long long c_t = 1;
    for (long long c = run_time[i][1]; c < run_time[i][0]; c++) {
      if (en_time[c] == c_t) {
        f = 1;
        break;
      }
      c_t++;
    }
    ans += f;
  }
  cout << ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  long long t = 1;
  t = 1;
  long long tc = 1;
  while (t--) {
    solve(tc);
    tc++;
  }
}
