#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 1020;
long long n, k, m;
long long a[MAXN];
set<pair<pair<long long, long long>, long long> > s;
long long ind;
long long ans;
long long is_int[MAXN];
void solve() {
  cin >> n >> k;
  for (long long i = 0; i < n; ++i) cin >> a[i];
  while (1) {
    if (ind == n && s.empty()) break;
    set<pair<pair<long long, long long>, long long> > q;
    for (auto u : s)
      if (u.first.first == u.first.second + 1)
        ++m;
      else
        q.insert(u);
    while (ind != n && q.size() != k) {
      q.insert(make_pair(make_pair(1, a[ind]), ind));
      ++ind;
    }
    long long d = (long long)(100.0 * m / n + 0.5);
    for (auto u : q)
      if (u.first.first == d) is_int[u.second] = 1;
    s.clear();
    for (auto u : q)
      s.insert(
          make_pair(make_pair(u.first.first + 1, u.first.second), u.second));
  }
  for (long long i = 0; i < n; ++i)
    if (is_int[i]) ++ans;
  cout << ans;
}
signed main() {
  cin.tie(0);
  cout.tie(0);
  cout.precision(30);
  solve();
  return 0;
}
