#include <bits/stdc++.h>
using namespace std;
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  for (auto i : v) os << "(" << i.x << ", " << i.y << ") ";
  return os;
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v) {
  for (auto i : v) os << i << " ";
  return os;
}
template <typename T>
T read() {
  T sgn = 1, res = 0;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') sgn = -sgn;
    c = getchar();
  }
  while ('0' <= c && c <= '9') {
    res = res * 10 + c - '0';
    c = getchar();
  }
  return res * sgn;
}
struct node {
  int x, y, id;
  node(int x = 0, int y = 0, int id = 0) : x(x), y(y), id(id) {}
  bool operator<(const node& cmp) const {
    if (x != cmp.x)
      return x < cmp.x;
    else
      return id < cmp.id;
  }
};
const int INF = 1e9 + 7;
const int N = 1e5 + 233;
int dig[N], cur[N];
vector<node> s;
set<int> cnt;
int round_div(int x, int y) {
  double a = static_cast<double>(x);
  double b = static_cast<double>(y);
  return static_cast<int>(a / b * 100 + .5);
}
int main() {
  int n = read<int>();
  int k = read<int>();
  int com = 0;
  int c = 0;
  for (int i = 0; i < n; ++i) dig[i] = read<int>();
  while (s.size() < k) {
    s.emplace_back(dig[c], dig[c], c);
    c++;
  }
  sort(s.begin(), s.end());
  int ans = 0;
  while (com < n) {
    int i = 0;
    while (i < s.size() && s[i].x == 0) {
      if (c < n) {
        s[i++] = node(dig[c], dig[c], c);
        c++;
      } else
        s[i++] = INF;
      com++;
    }
    for (auto& i : s) i.x--;
    sort(s.begin(), s.end());
    int rate = round_div(com, n);
    for (auto i : s) {
      if (rate && rate == i.y - i.x) {
        cnt.insert(i.id);
      }
    }
  }
  printf("%d\n", cnt.size());
  return 0;
}
