#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long MAXN = 2;
inline long long read() {
  long long x = 0, w = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') {
      w = -1;
    }
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = (x << 3) + (x << 1) + c - '0';
    c = getchar();
  }
  return x * w;
}
inline void write(long long n) {
  if (n < 0) {
    putchar('-');
    n = -n;
  }
  if (n >= 10) {
    write(n / 10);
  }
  putchar(n % 10 + '0');
}
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long qpow(long long a, long long n) {
  long long base = a;
  long long res = 1;
  while (n) {
    if (n & 1) res *= base;
    base *= base;
    n >>= 1;
  }
  return res;
}
long long qpowmod(long long a, long long n) {
  long long base = a;
  long long res = 1;
  while (n) {
    if (n & 1) res = (base * res) % mod;
    base = (base * base) % mod;
    n >>= 1;
  }
  return res;
}
long long a[1600], b[1600], c[1600], bv[1600], vis[1600];
long long n, k;
long long m = 0, y = 0, d = 0, cnt = 0;
void init() {
  n = read(), k = read();
  for (long long i = 1; i <= n; i++) {
    a[i] = read();
  }
}
signed main() {
  init();
  while (m < n) {
    for (long long i = 1; i <= k; i++) {
      bv[i]++;
      if (!vis[c[i]] && c[i] &&
          bv[i] == (long long)(100 * (double)m / (double)n + 0.5))
        cnt++, vis[c[i]] = 1;
    }
    for (long long i = 1; i <= k; i++) {
      if (bv[i] == a[c[i]]) {
        c[i] = 0;
        m++;
      }
      if (!c[i] && y < n) {
        c[i] = ++y;
        bv[i] = 0;
      }
    }
  }
  write(cnt);
}
