#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma G++ optimize("O3")
using namespace std;
const long long llINF = 9223372036854775807;
const int INF = 2147483647;
const int maxn = 1e6 + 7;
const int maxm = 2e5 + 7;
const long long mod = 998244353;
const double pi = acos(-1.0);
const double eps = 1e-9;
int n, k;
int m;
int a[1007];
int cur[107];
int last[107];
bool used[1007];
int ans;
int main(int argc, char const *argv[]) {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 1; i <= k; i++) {
    cur[i] = -1;
    last[i] = -1;
  }
  int p = 0;
  for (int i = 0; i <= n * 150; i++) {
    for (int j = 1; j <= k; j++) {
      if (last[j] == i) {
        cur[j] = -1;
        last[j] = -1;
        used[j] = 0;
        m++;
      }
    }
    for (int j = 1; j <= k; j++) {
      if (cur[j] == -1 && p < n) {
        cur[j] = ++p;
        last[j] = i + a[p];
      }
    }
    int d = 100.0 * (double)m / (double)n + 0.5;
    for (int j = 1; j <= k; j++) {
      if (cur[j] != -1 && a[cur[j]] - (last[j] - i) + 1 == d && !used[j]) {
        used[j] = 1;
        ans++;
      }
    }
  }
  printf("%d\n", ans);
  return 0;
}
