#include <bits/stdc++.h>
using namespace std;
long long round(long long x, long long y) {
  long long z = x % y;
  if (z >= (long long)ceil(y / 2.0))
    return ceil(x / (double)y);
  else
    return (x / y);
}
int main(void) {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  srand(time(NULL));
  ;
  int t = 1;
  while (t--) {
    long long n, i, j, k, x, y, z, w, t1, t2, t3, ans = 0;
    cin >> n >> k;
    vector<long long> v(n);
    vector<bool> mark(n, 0);
    for (i = 0; i < n; i++) cin >> v[i];
    vector<pair<long long, long long> > p;
    pair<long long, long long> p1, p2;
    for (i = 0; i < k && i < n; i++) {
      p.push_back(make_pair(v[i], i));
    }
    sort(p.begin(), p.end(), greater<pair<long long, long long> >());
    x = p.size();
    y = 0;
    j = k;
    while (x != 0) {
      p1 = p[x - 1];
      for (i = 0; i < x; i++) p[i].first -= p1.first;
      for (i = x - 1; i >= 0; i--) {
        if (p[i].first == 0) y++, z = i;
      }
      x = z;
      for (i = z; i < k && j < v.size(); i++, j++) {
        p[i] = make_pair(v[j], j);
        x++;
      }
      sort(p.begin(), p.begin() + x, greater<pair<long long, long long> >());
      for (i = 0; i < x; i++) {
        for (t2 = 0; t2 < p[x - 1].first; t2++) {
          t1 = v[p[i].second] - p[i].first + 1 + t2;
          if (t1 == (long long)round(y * 100, n) && !mark[p[i].second])
            mark[p[i].second] = 1, ans++;
        }
      }
    }
    cout << ans << "\n";
  }
  return 0;
}
