#include <bits/stdc++.h>
using namespace std;
int graded[20000000];
int main() {
  int n, k;
  scanf("%d %d", &n, &k);
  int arr[n];
  for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
  priority_queue<int> pq;
  for (int i = 0; i < k && i < n; i++) pq.push(-arr[i]);
  int time = 0;
  int pnt = k;
  int gr = 0;
  int grading_time[n];
  for (int i = 0; i < k && i < n; i++) grading_time[i] = 0;
  while (!pq.empty()) {
    int next_time = -pq.top();
    pq.pop();
    for (int j = time; j < next_time; j++) {
      graded[j] = (200 * gr + n) / (2 * n);
    }
    gr++;
    if (pnt < n) {
      grading_time[pnt] = next_time;
      pq.push(-(next_time + arr[pnt]));
      pnt++;
    }
    time = next_time;
  }
  graded[time] = 100;
  int ans = 0;
  for (int i = 0; i < n; i++) {
    bool b = false;
    for (int j = 0; j < arr[i]; j++) {
      if (graded[grading_time[i] + j] == j + 1) {
        b = true;
      }
    }
    ans += b;
  }
  printf("%d\n", ans);
  return 0;
}
