#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 7;
const long long ool = 1e18 + 7;
const int ooi = 1e9 + 7;
const long long mod = 1e9 + 7;
int n, k, m;
vector<pair<int, int> > tv;
queue<pair<int, int> > q;
int seq[maxn];
set<int> st;
void init() {
  cin >> n >> k;
  for (long long i = (0); i < (n); i++)
    cin >> seq[i], q.push(make_pair((seq[i]), (i)));
  tv = vector<pair<int, int> >(min(n, k), {-1, -1});
  k = min(n, k);
  for (long long i = (0); i < (k); i++) tv[i] = {1, i}, q.pop();
}
int cal(int x) { return floor(100.0 * x * 1.0 / n + 0.5); }
void solve() {
  int tn = 0;
  int now = 0;
  int ans = 0;
  while (tn < n) {
    for (long long i = (0); i < (k); i++) {
      if (tv[i].first == -1) continue;
      if (now == tv[i].first) {
        st.insert(tv[i].second);
      }
      tv[i].first++;
      if (tv[i].first > seq[tv[i].second]) {
        if (!q.empty()) {
          tv[i] = {1, q.front().second};
          q.pop();
        } else {
          tv[i].first = -1;
          tv[i].second = 0;
        }
        tn++;
      }
    }
    now = cal(tn);
  }
  ans = st.size();
  cout << ans << endl;
}
int main(void) {
  init();
  solve();
  return 0;
}
