#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, k;
  cin >> n >> k;
  int a[1005];
  for (int i = 0; i < n; i++) cin >> a[i];
  int st[1005];
  int end[105];
  int subs[105];
  for (int i = 1; i <= k; i++) end[i] = -1;
  int subind = 0;
  int curt = 0;
  int finished = 0;
  int ans = 0;
  bool inans[1005];
  memset(inans, 0, sizeof(bool) * 1005);
  while (1) {
    for (int i = 1; i <= k; i++) {
      if (end[i] == -1 && subind < n) {
        end[i] = a[subind] + curt;
        subs[i] = subind;
        st[i] = curt;
        subind++;
      }
    }
    int d = round(100 * (float)finished / n);
    int mint = 50000000;
    for (int i = 1; i <= k; i++)
      if (end[i] != -1) mint = min(mint, end[i]);
    for (int i = 1; i <= k; i++) {
      if (d >= curt - st[i] + 1 && d < mint - st[i] + 1 && !inans[subs[i]] &&
          end[i] != -1) {
        ans++;
        inans[subs[i]] = 1;
      }
    }
    for (int i = 1; i <= k; i++) {
      if (end[i] == mint) {
        finished++;
        end[i] = -1;
      }
    }
    curt = mint;
    if (subind == n) {
      int tob = 1;
      for (int i = 1; i <= k; i++) {
        if (end[i] != -1) tob = 0;
      }
      if (tob) break;
    }
  }
  cout << ans << endl;
  return 0;
}
