#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
int main(int argc, char* argv[]) {
  std::ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.precision(10);
  int n, k;
  cin >> n >> k;
  auto solutions = queue<int>();
  for (int i = 0; i < (n); ++i) {
    int c;
    cin >> c;
    solutions.push(c);
  }
  auto interesting = 0;
  auto solved = 0;
  auto procs = vector<pair<int, int>>(k, make_pair(0, 0));
  auto found = vector<int>(k, false);
  for (auto time = 1; solved < n; ++time) {
    auto d = static_cast<int>(100.0 * solved / n + 0.5);
    for (int i = 0; i < (k); ++i) {
      auto& proc = procs[i];
      auto& done_test = proc.first;
      auto& tests = proc.second;
      if (done_test != 0 && d == done_test) found[i] = true;
      if (done_test == tests) {
        interesting += (found[i]);
        found[i] = false;
        if (tests != 0) solved++;
        if (!solutions.empty()) {
          proc = make_pair(1, solutions.front());
          solutions.pop();
        } else {
          proc = make_pair(0, 0);
        }
      } else {
        done_test++;
      }
    }
  }
  cout << interesting << '\n';
  return 0;
}
