class Fenwick_Tree: def __init__(self, n): self._n = n self.data = [0] * n def add(self, p, x): assert 0 <= p < self._n p += 1 while p <= self._n: self.data[p - 1] += x p += p & -p def sum(self, l, r): assert 0 <= l <= r <= self._n return self._sum(r) - self._sum(l) def _sum(self, r): s = 0 while r > 0: s += self.data[r - 1] r -= r & -r return s def get(self, k): k += 1 x, r = 0, 1 while r < self._n: r <<= 1 len = r while len: if x + len - 1 < self._n: if self.data[x + len - 1] < k: k -= self.data[x + len - 1] x += len len >>= 1 return x N, K = map(int, input().split()) M = 10 ** 6 + 5 T = Fenwick_Tree(M) L = [0] * M for i in range(N): w = int(input()) if w > 0: if T.sum(w, M) >= K: continue else: L[w] += 1 T.add(w, 1) else: w = -w if L[w] == 0: continue else: L[w] -= 1 T.add(w, -1) print(T.sum(0, M))