#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (b > a) {
    return gcd(b, a);
  }
  if (b == 0) {
    return a;
  }
  return gcd(b, a % b);
}
long long expo(long long a, long long b, long long mod) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b = b >> 1;
  }
  return res;
}
vector<int> sieve(int n) {
  int *arr = new int[n + 1]();
  vector<int> vect;
  for (int i = 2; i <= n; i++)
    if (arr[i] == 0) {
      vect.push_back(i);
      for (int j = 2 * i; j <= n; j += i) arr[j] = 1;
    }
  return vect;
}
void extendgcd(long long a, long long b, long long *v) {
  if (b == 0) {
    v[0] = 1;
    v[1] = 0;
    v[2] = a;
    return;
  }
  extendgcd(b, a % b, v);
  long long x = v[1];
  v[1] = v[0] - v[1] * (a / b);
  v[0] = x;
  return;
}
long long mminv(long long a, long long b) {
  long long arr[3];
  extendgcd(a, b, arr);
  return arr[0];
}
long long mminvprime(long long a, long long b) { return expo(a, b - 2, b); }
bool revsort(long long a, long long b) { return a > b; }
void swap(int &x, int &y) {
  int temp = x;
  x = y;
  y = temp;
}
long long combination(long long n, long long r, long long m, long long *fact) {
  long long val1 = fact[n];
  long long val2 = mminvprime(fact[r], m);
  long long val3 = mminvprime(fact[n - r], m);
  return ((val1 * val2) % m * val3) % m;
}
int func(int n, int m) { return (200 * m + n) / (2 * n); }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n, k;
  cin >> n >> k;
  int *arr = new int[n];
  int *test = new int[n]();
  bool *used = new bool[n]();
  for (int i = 0; i < n; i++) cin >> arr[i];
  int *process = new int[k];
  for (int i = 0; i < k; i++) process[i] = -1;
  int total = 0;
  for (int i = 0; i < min(n, k); i++) process[i] = i;
  int next = min(n, k);
  int time = 0;
  long long ans = 0;
  while (true) {
    time++;
    for (int i = 0; i < min(n, k); i++) {
      if (process[i] == -1) continue;
      test[process[i]]++;
      if (func(n, total) == test[process[i]]) {
        if (!used[process[i]]) {
          used[process[i]] = true;
          ans++;
        }
      }
    }
    for (int i = 0; i < min(n, k); i++) {
      if (process[i] == -1) continue;
      if (test[process[i]] == arr[process[i]]) {
        total++;
        if (next == n) {
          process[i] = -1;
          continue;
        } else {
          process[i] = next;
          next++;
        }
      }
    }
    int counter = 0;
    for (int i = 0; i < k; i++) {
      if (process[i] != -1) counter = 1;
    }
    if (counter == 0) break;
  }
  cout << ans << endl;
  return 0;
}
