#include <bits/stdc++.h>
using namespace std;
int arr[1005], test[105], s[105];
int main() {
  int n, k, ind = 0, cnt = 0;
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  set<int> s1;
  while (true) {
    int x = 0;
    for (int i = 0; i < k; i++) {
      if (test[i] == 0) x += 1;
    }
    if (x == k && ind >= n) break;
    for (int i = 0; i < k; i++) {
      if (test[i] > 0) {
        test[i] += 1;
        if (test[i] > arr[s[i]]) {
          test[i] = 0;
          cnt += 1;
        }
      }
      if (test[i] == 0 && ind < n) {
        s[i] = ind;
        test[i] = 1;
        ind += 1;
      }
    }
    int p = 100 * (cnt + 0.0) / (n + 0.0) + 0.5;
    for (int i = 0; i < k; i++) {
      if (test[i] != 0 && test[i] == p) s1.insert(s[i]);
    }
  }
  cout << s1.size();
  return 0;
}
