#include <bits/stdc++.h>
using namespace std;
int n, k;
int a[100001];
int cur[100001];
int last[100001];
int used[100001];
int sz;
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (int i = 1; i <= k; i++) {
    cur[i] = -1;
    last[i] = -1;
  }
  int cnt = 0, ans = 0;
  for (int i = 0; i <= 150 * n; i++) {
    for (int j = 1; j <= k; j++) {
      if (last[j] == i) {
        cur[j] = -1;
        last[j] = -1;
        used[j] = 0;
        cnt++;
      }
    }
    for (int j = 1; j <= k; j++) {
      if (cur[j] == -1 && sz < n) {
        cur[j] = ++sz;
        last[j] = i + a[sz];
      }
    }
    long double y = 100.0 * cnt / n + 0.5;
    int x = y;
    for (int j = 1; j <= k; j++) {
      if (cur[j] != -1 && a[cur[j]] - (last[j] - i) + 1 == x && !used[j]) {
        used[j] = 1;
        ans++;
      }
    }
  }
  cout << ans;
}
