#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e3 + 10;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const double PI = acos(-1.0);
int a[MAX];
int b[MAX];
int p[MAX];
int v[MAX];
int n, k, m = 0, ans = 0;
void cal() {
  while (*min_element(p + 1, p + k + 1) > 0) {
    for (int j = 1; j <= k; j++) {
      int d = (int)(100.0 * m / n + 0.5);
      if (b[p[j]] + 1 == d && v[p[j]] == 0) {
        v[p[j]] = 1;
        ans++;
      }
    }
    for (int j = 1; j <= k; j++) {
      b[p[j]]++;
      if (b[p[j]] == a[p[j]]) m++;
    }
    for (int j = 1; j <= k; j++)
      if (b[p[j]] == a[p[j]]) p[j] = 0;
  }
}
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 1; i <= n; i++) {
    cal();
    for (int j = 1; j <= k; j++) {
      if (p[j] == 0) {
        p[j] = i;
        break;
      }
    }
    cal();
  }
  while (*max_element(p + 1, p + k + 1) > 0) {
    int d = (int)(100.0 * m / n + 0.5);
    for (int j = 1; j <= k; j++) {
      if (p[j] == 0) continue;
      if (v[p[j]]) continue;
      if (b[p[j]] == a[p[j]]) continue;
      if (b[p[j]] + 1 == d) {
        v[p[j]] = 1;
        ans++;
      }
    }
    for (int j = 1; j <= k; j++) {
      if (p[j] == 0) continue;
      b[p[j]]++;
      if (b[p[j]] == a[p[j]]) m++;
    }
    for (int j = 1; j <= k; j++)
      if (b[p[j]] == a[p[j]]) p[j] = 0;
  }
  cout << ans << endl;
  return 0;
}
