#include <bits/stdc++.h>
using namespace std;
signed main() {
  long long int n, k;
  cin >> n >> k;
  vector<long long int> a(n);
  for (long long int i = 0; i < n; ++i) cin >> a[i];
  vector<pair<long long int, long long int>> b;
  multiset<long long int> se;
  for (long long int i = 0; i < k; ++i) {
    se.insert(a[i]);
    b.push_back({0, a[i]});
  }
  for (long long int i = k; i < n; ++i) {
    long long int t = *se.begin();
    se.erase(se.begin());
    se.insert(t + a[i]);
    b.push_back({t, t + a[i]});
  }
  sort(b.begin(), b.end(),
       [](const pair<long long int, long long int>& a,
          const pair<long long int, long long int>& b) {
         return a.second < b.second;
       });
  long long int ans = 0;
  for (long long int m = 0; m < n; ++m) {
    bool add = 0;
    long long int now = 1, last = b[m].first;
    for (long long int i = 0; i < m; ++i) {
      if (b[i].second > b[m].first) {
        long long int next = now + b[i].second - last - 1;
        long long int q = round(100.0 * i / n);
        if (now <= q && q <= next) add = 1;
        now = next + 1;
        last = b[i].second;
      }
    }
    long long int next = now + b[m].second - last - 1;
    long long int q = round(100.0 * m / n);
    if (now <= q && q <= next) add = 1;
    ans += add;
  }
  cout << ans << "\n";
  return 0;
}
