#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))
#define uniq(v) (v).erase(unique(all(v)), (v).end())

using namespace std;

using i32 = int;
using i64 = long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T power(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, const vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }

template <typename T>
struct SegmentTree {
  vector<T> v;
  T f(T a, T b) { return a + b; }
  T e;
  int n = 1;
  SegmentTree(int size, T e) : e(e) {
    while (n < size) n <<= 1;
    v.resize(n * 2, e);
  }
  void set(int k, T x) {
    v[k += n] = x;
  }
  void build() {
    rrep(i, n) v[i] = f(v[i * 2 + 0], v[i * 2 + 1]);
  }
  void update(int k, T x) {
    v[k += n] = x;
    while (k >>= 1) v[k] = f(v[k * 2 + 0], v[k * 2 + 1]);
  }
  T query(int a, int b, int k = 1, int l = 0, int r = -1) {
    if (r == -1) r = n;
    if (b <= l || r <= a) return e;
    if (a <= l && r <= b) return v[k];
    T ret = e;
    ret = f(ret, query(a, b, k * 2 + 0, l, (l + r) / 2));
    ret = f(ret, query(a, b, k * 2 + 1, (l + r) / 2, r));
    return ret;
  }
};

void solve() {
  int N, K; cin >> N >> K;
  auto st = SegmentTree<int>(1000010, 0);
  rep(i, N) {
    int W; cin >> W;
    if (W > 0) {
      if (st.query(W, 1000010) >= K) {
      } else {
        auto v = st.query(W, W + 1);
        st.update(W, v + 1);
      }
    } else {
      W *= -1;
      int v;
      if ((v = st.query(W, W + 1)) == 0) {
      } else {
        st.update(W, v - 1);
      }
    }
  }
  int ans = 0;
  reps(i, 1000000) {
    ans += st.query(i, i + 1);
  }
  cout << ans << '\n';
}