#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n, k;
  cin >> n >> k;
  long long a[n][2];
  for (long long i = 0; i < n; i++) {
    cin >> a[i][0];
    a[i][1] = a[i][0];
  }
  long long ans = 0, cnt = 0;
  long long b[n][2];
  for (long long i = 0; i < n; i++) {
    b[i][0] = 0;
    b[i][1] = 0;
  }
  long long j = min(n, k);
  long long hey = 0, kk = k;
  while (1) {
    long long mn = 10000, ind;
    for (long long i = 0; i < j; i++) {
      if (b[i][0] == 0) {
        if (a[i][0] < mn) {
          mn = a[i][0];
        }
      }
    }
    if (hey != 0) {
      for (long long i = 0; i < j; i++) {
        if (b[i][0] == 0) {
          long long var = a[i][1] - a[i][0];
          if (var < hey && (var + mn) >= hey && a[i][1] >= hey &&
              b[i][1] == 0) {
            b[i][1] = 1;
            ans++;
          }
        }
      }
    }
    for (long long i = 0; i < j; i++) {
      if (b[i][0] == 0) a[i][0] = a[i][0] - mn;
    }
    long long ii = 0;
    for (long long i = 0; i < j; i++) {
      if (a[i][0] == 0 && b[i][0] == 0) {
        cnt++;
        b[i][0] = 1;
        ii++;
      }
    }
    hey = floor(((100.0) * (((long double)(cnt)) / ((long double)(n)))) + 0.5);
    if (j < n) j = j + ii;
    if (j > n) j = n;
    if (cnt >= n) break;
  }
  cout << ans;
}
