import sys import math import bisect from heapq import heapify, heappop, heappush from collections import deque, defaultdict, Counter from functools import lru_cache from itertools import accumulate, combinations, permutations, product sys.setrecursionlimit(1000000) MOD = 10 ** 9 + 7 MOD99 = 998244353 input = lambda: sys.stdin.readline().strip() NI = lambda: int(input()) NMI = lambda: map(int, input().split()) NLI = lambda: list(NMI()) SI = lambda: input() SMI = lambda: input().split() SLI = lambda: list(SMI()) EI = lambda m: [NLI() for _ in range(m)] class BIT(): """ BIT 0-index ACL for python add(p, x): p番目にxを加算 get(p): p番目を取得 sum0(r): [0:r)の和を取得 sum(l, r): [l:r)の和を取得 """ def __init__(self, N): self.n = N self.data = [0 for i in range(N)] def add(self, p, x): assert 0 <= p < self.n, "0<=p 0): s += self.data[r - 1] r -= r & -r return s def debug(self): res = [self.get(p) for p in range(self.n)] return res def main(): N, K = NMI() W = [NI() for _ in range(N)] M = 1000000 bit = BIT(M+1) for w in W: if w > 0: k = bit.sum(w, M+1) if k < K: bit.add(w, 1) else: w = -w if bit.get(w) > 0: bit.add(w, -1) print(bit.sum(0, M+1)) if __name__ == "__main__": main()