#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n, k;
  cin >> n >> k;
  int a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  int count = 0;
  vector<pair<pair<int, int>, int>> q;
  int help = 0;
  int beg = 0;
  int final = 0;
  set<int> s;
  while (1) {
    while (beg < n && q.size() < k) {
      q.push_back({{0, a[beg]}, beg + 1});
      beg++;
    }
    if (q.size() == 0) break;
    double per1 = (double)(100 * final) / n;
    per1 += 0.5;
    int per = floor(per1);
    vector<pair<pair<int, int>, int>> help;
    help.clear();
    for (auto j : q) {
      j.first.first++;
      if (j.first.first == j.first.second) {
        if (j.first.first == per) {
          s.insert(j.second);
        }
        final++;
        continue;
      } else if (j.first.first == per) {
        s.insert(j.second);
        count++;
      }
      help.push_back(j);
    }
    q = help;
  }
  cout << s.size() << '\n';
}
int32_t main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL),
      cout << setprecision(14);
  ;
  int t = 1;
  while (t--) {
    solve();
  }
}
