#include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long>> cnt[300000];
long long lst[300000];
int main() {
  long long i, j, n, m, k, a, l, r;
  cin >> n >> k;
  double d;
  long long ans = 0;
  long long ar[n + 10];
  priority_queue<long long, vector<long long>, greater<long long>> pq;
  for (i = 0; i < k; i++) pq.push(0);
  for (i = 0; i < n; i++) {
    cin >> ar[i];
  }
  long long st = 0;
  while (st < n) {
    a = pq.top();
    pq.pop();
    l = a;
    r = l + ar[st];
    lst[r]++;
    for (i = l, j = 1; i < r; i++, j++) cnt[i].push_back({st, j});
    pq.push(r);
    st++;
  }
  for (i = 1; i <= 200008; i++) lst[i] += lst[i - 1];
  set<long long> pt;
  for (i = 0; i <= 200008; i++) {
    d = (double)lst[i] / (double)n;
    d *= 100.00;
    d += 0.5;
    a = floor(d);
    for (auto x : cnt[i]) {
      if (x.second == a) pt.insert(x.first);
    }
  }
  ans = pt.size();
  cout << ans << endl;
}
