#include <bits/stdc++.h>
using namespace std;
const long double EPS = 1e-9;
const long double PI = acos(-1.0);
const int MX = 6e5 + 5;
long long mod = 1e9 + 7;
int a[1005], interesting[1005];
int b[1005];
int main() {
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  set<int> running;
  for (int i = 1; i <= m and i <= n; i++) running.insert(i);
  int nxt = m + 1;
  int done = 0;
  for (int t = 0;;) {
    int x = round(100.0 * done / n);
    set<int> deleted;
    for (int i : running) {
      b[i]++;
      if (b[i] == x) interesting[i] = 1;
      if (a[i] == b[i]) {
        deleted.insert(i);
      }
    }
    done += ((int)(deleted).size());
    for (int i = 0; i < ((int)(deleted).size()) and nxt <= n; i++, nxt++) {
      running.insert(nxt);
    }
    for (int i : deleted) running.erase(i);
    if (((int)(running).size()) == 0) break;
  }
  cout << accumulate(interesting + 1, interesting + 1 + n, 0) << '\n';
  return 0;
}
