#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 arr[1005];
  for (int i = 0; i < n; i++) cin >> arr[i];
  multiset<pair<int, int>> subqu;
  int subind = 0;
  int st[1005];
  for (int i = 0; i < k; i++) {
    if (subind <= n - 1) {
      subqu.insert({arr[subind] + 1, subind});
      st[subind] = 1;
      subind++;
    }
  }
  int curt = 1;
  int m = 0;
  int d = 0;
  int fcount = 0;
  bool intbool[1005];
  for (int i = 0; i < n; i++) intbool[i] = 0;
  while (!subqu.empty()) {
    int e = subqu.begin()->first;
    for (auto it = subqu.begin(); it != subqu.end(); it++) {
      int si = st[it->second];
      int ti = d + si - 1;
      if (ti < e && ti >= curt && intbool[it->second] == 0) {
        fcount++;
        intbool[it->second] = 1;
      }
    }
    int j = 0;
    for (auto it = subqu.begin(); it != subqu.end();) {
      if (it->first > e) break;
      auto tit = it;
      it++;
      subqu.erase(tit);
      j++;
    }
    m += j;
    d = round(100 * (float)m / n);
    curt = e;
    for (int i = 0; i < j; i++) {
      if (subind <= n - 1) {
        subqu.insert({arr[subind] + e, subind});
        st[subind] = e;
        subind++;
      }
    }
  }
  cout << fcount << endl;
  return 0;
}
