#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  ;
  long long n, k;
  cin >> n >> k;
  long long a[n];
  for (long long i = 0; i < n; i++) cin >> a[i];
  long long d[n];
  for (long long i = 0; i < n; i++) d[i] = 0;
  long long pos[k];
  for (long long i = 0; i < k; i++) pos[i] = -1;
  long long cnt = 0;
  long double solved = 0;
  long long lasttaken = -1;
  map<long long, bool> visited;
  for (long long i = 1; i < 151 * n; i++) {
    for (long long j = 0; j < k; j++) {
      if (pos[j] != -1) continue;
      if (lasttaken == n - 1) break;
      lasttaken++;
      pos[j] = lasttaken;
    }
    for (long long j = 0; j < k; j++) {
      if (pos[j] != -1) d[pos[j]]++;
    }
    long long comp1 =
        (((solved * 100.0) / ((long double)n)) + (long double)0.5);
    for (long long j = 0; j < k; j++) {
      if (pos[j] == -1 || comp1 == 0) continue;
      if (comp1 == d[pos[j]]) {
        if (visited[pos[j]] == false) {
          cnt++;
          visited[pos[j]] = true;
        }
      }
    }
    for (long long j = 0; j < k; j++) {
      if (pos[j] != -1 && d[pos[j]] == a[pos[j]]) {
        solved++;
        pos[j] = -1;
      }
    }
  }
  cout << cnt << endl;
  return 0;
}
