#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > vek;
vector<set<int>::iterator> del;
set<int> setic;
int n, k, tim, m, sol;
bool bio[1010];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    int z;
    cin >> z;
    vek.push_back(make_pair(0, z));
  }
  for (int i = 0; i < min(k - 1, n); i++) setic.insert(i);
  for (int i = k - 1; i < n; i++) {
    setic.insert(i);
    while (setic.size() == k) {
      for (auto it = setic.begin(); it != setic.end(); it++) {
        int x = *it;
        vek[x].first++;
        if (vek[x].first == tim && !bio[x]) {
          sol++;
          bio[x] = 1;
        }
        if (vek[x].first == vek[x].second) {
          auto y = it;
          del.push_back(y);
          m++;
        }
      }
      double u = m;
      double y = n;
      double c = (u / y) * 100;
      int l = c;
      double q = l;
      if (c - q < 0.5)
        tim = (int)q;
      else
        tim = (int)q + 1;
      for (int j = 0; j < del.size(); j++) setic.erase(del[j]);
      del.clear();
    }
  }
  while (setic.size()) {
    for (auto it = setic.begin(); it != setic.end(); it++) {
      int x = *it;
      vek[x].first++;
      if (vek[x].first == tim && !bio[x]) {
        sol++;
        bio[x] = 1;
      }
      if (vek[x].first == vek[x].second) {
        auto y = it;
        del.push_back(y);
        m++;
      }
    }
    double u = m;
    double y = n;
    double c = (u / y) * 100;
    int l = c;
    double q = l;
    if (c - q < 0.5)
      tim = (int)q;
    else
      tim = (int)q + 1;
    for (int j = 0; j < del.size(); j++) setic.erase(del[j]);
    del.clear();
  }
  cout << sol;
  return 0;
}
