#include <bits/stdc++.h>
using namespace std;
int n, k;
int arr[1003];
void read() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) cin >> arr[i];
}
pair<int, int> curr[103];
int done = 0, next_idx;
bool is[1003];
void solve() {
  for (int i = 1; i <= min(n, k); i++) curr[i] = {1, i};
  next_idx = min(n, k) + 1;
  for (;;) {
    bool can = false;
    for (int i = 1; i <= min(n, k); i++)
      if (curr[i].first != -1) {
        can = true;
        break;
      }
    if (!can) break;
    for (int i = 1; i <= min(n, k); i++) {
      if (curr[i].first == round((long double)done / (long double)n * 100.0))
        is[curr[i].second] = true;
    }
    for (int i = 1; i <= min(n, k); i++)
      if (curr[i].first != -1) {
        curr[i].first++;
        if (curr[i].first == arr[curr[i].second] + 1) {
          done++;
          if (next_idx <= n) {
            curr[i].first = 1;
            curr[i].second = next_idx;
            next_idx++;
          } else
            curr[i].first = -1;
        }
      }
  }
  int ans = 0;
  for (int i = 1; i <= n; i++)
    if (is[i]) ans++;
  cout << ans << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  read();
  solve();
}
