#include <bits/stdc++.h>
using namespace std;
int a[1005];
map<int, pair<int, int>> m;
map<int, int> mark;
int main() {
  int n, k, num = 0, ans = 0;
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (int i = 1; i <= k; i++) {
    m[i].first = i;
    m[i].second = 1;
  }
  while (num < n) {
    int x = ((int)((double)num * 100 / (double)n + 0.5));
    for (int i = 1; i <= k; i++) {
      if (x == m[i].second) {
        if (!mark[m[i].first]) {
          mark[m[i].first] = 1;
          ans++;
        }
      }
      if (m[i].second == a[m[i].first]) {
        num++;
        if (num + k <= n) {
          m[i].first = k + num;
          m[i].second = 1;
        } else
          m[i].second = a[m[i].first] + 100000;
      } else
        m[i].second++;
    }
  }
  cout << ans << endl;
}
