#include <bits/stdc++.h>
using namespace std;
template <typename T>
void remin(T& a, const T& b) {
  if (b < a) a = b;
}
template <typename T>
void remax(T& a, const T& b) {
  if (b > a) a = b;
}
int N, K;
int arr[1005];
int interesting_sol[1005];
int main(int argc, const char** argv) {
  set<int> s;
  vector<int> v;
  int total = 0, ans = 0;
  int fully_tested = 0;
  int idx;
  scanf("%d%d", &N, &K);
  for (int k = 0; k < K && k < N; ++k) {
    s.insert(k);
  }
  idx = K;
  v.resize(N);
  for (int k = 0; k < N; ++k) {
    scanf("%d", &v[k]);
    arr[k] = v[k];
    total += v[k];
  }
  vector<int> to_add, to_remove;
  for (int k = 0; k < total; ++k) {
    to_add.clear();
    to_remove.clear();
    if (!s.size()) break;
    int tested = 0;
    for (auto el : s) {
      v[el]--;
      if (v[el] == 0) {
        tested++;
        if (fully_tested == N) goto end;
        if (idx < N) {
          to_add.push_back(idx);
        }
        to_remove.push_back(el);
        idx++;
      }
      if (fully_tested &&
          (arr[el] - v[el] == (int)(100.0 * fully_tested / N + 0.5))) {
        if (!interesting_sol[el]) {
          ans++;
          interesting_sol[el] = 1;
        }
      }
    }
    fully_tested += tested;
    for (auto el : to_add) {
      s.insert(el);
    }
    for (auto el : to_remove) {
      s.erase(el);
    }
  }
end:
  printf("%d\n", ans);
  return 0;
}
