#include <bits/stdc++.h>
using namespace std;
long long mod = 998244353;
long long mod2 = 1e9 + 7;
long long n, k;
int a[1005];
void solve() {
  cin >> n >> k;
  for (int i = 0; i < n; ++i) cin >> a[i];
  priority_queue<pair<int, pair<int, int>>> q;
  int i = 0;
  while (i < k && i < n) {
    q.push(make_pair(-a[i], make_pair(-a[i], i)));
    ++i;
  }
  set<int> ans;
  int j = 0;
  int sum = 0;
  while (q.size()) {
    pair<int, pair<int, int>> t = q.top();
    q.pop();
    ++j;
    t.first = -t.first;
    t.second.first = -t.second.first;
    int d = 100 * ((double)j / n) + 0.5;
    sum = t.first;
    if (i < n) {
      q.push(make_pair(-(sum + a[i]), make_pair(-a[i], i)));
      ++i;
    }
    int range = -q.top().first - t.first;
    priority_queue<pair<int, pair<int, int>>> q1;
    while (q.size()) {
      pair<int, pair<int, int>> t1 = q.top();
      q.pop();
      q1.push(t1);
      t1.first = -t1.first;
      t1.second.first = -t1.second.first;
      if (sum - (t1.first - t1.second.first) + 1 <= d &&
          sum - (t1.first - t1.second.first) + range >= d) {
        ans.insert(t1.second.second);
      }
    }
    q = q1;
  }
  cout << ans.size();
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
