#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n, k;
  cin >> n >> k;
  vector<int> numTests(n);
  for (int i = 0; i < n; i++) {
    cin >> numTests[i];
  }
  int totTime = 0;
  int currPercentage = 0;
  set<pair<int, int> > st;
  for (int i = 0; i < k; i++) {
    st.insert({numTests[i], i});
  }
  int next = k;
  int completed = 0;
  int ans = 0;
  set<int> ansst;
  while (completed < n) {
    currPercentage = round(((double)(100.0 * completed)) / n);
    auto it1 = st.begin();
    int ctime = it1->first;
    int endTime = totTime + ctime;
    for (auto it : st) {
      int startTime = totTime - (numTests[it.second] - it.first);
      int loc = startTime + currPercentage;
      if (loc > totTime && loc <= endTime) {
        ansst.insert(it.second);
      }
    }
    totTime = endTime;
    set<pair<int, int> > st1;
    for (auto it : st) {
      if ((it.first - ctime) > 0) {
        st1.insert({it.first - ctime, it.second});
      } else {
        completed++;
      }
    }
    st.clear();
    for (auto it : st1) {
      st.insert(it);
    }
    while ((next < n) && (st.size() < k)) {
      st.insert({numTests[next], next});
      next++;
    }
  }
  cout << ansst.size() << endl;
  return 0;
}
