class BIT:
    def __init__(self, n):
        self.n = n
        self.bit = [0]*(self.n+1) # 1-indexed

    def init(self, init_val):
        for i, v in enumerate(init_val):
            self.add(i, v)

    def add(self, i, x):
        # i: 0-indexed
        i += 1 # to 1-indexed
        while i <= self.n:
            self.bit[i] += x
            i += (i & -i)

    def sum(self, i, j):
        # return sum of [i, j)
        # i, j: 0-indexed
        return self._sum(j) - self._sum(i)

    def _sum(self, i):
        # return sum of [0, i)
        # i: 0-indexed
        res = 0
        while i > 0:
            res += self.bit[i]
            i -= i & (-i)
        return res

    def lower_bound(self, x):
        s = 0
        pos = 0
        depth = self.n.bit_length()
        v = 1 << depth
        for i in range(depth, -1, -1):
            k = pos + v
            if k <= self.n and s + self.bit[k] < x:
                    s += self.bit[k]
                    pos += v
            v >>= 1
        return pos

    def __str__(self): # for debug
        arr = [self.sum(i,i+1) for i in range(self.n)]
        return str(arr)

import sys
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline

n, k = map(int, input().split())
W = [int(input()) for i in range(n)]
X = [abs(w) for w in W]
X = set(X)
X = list(X)
X.sort()
toid = {}
for i, x in enumerate(X):
    toid[x] = i
N = len(toid)
bit = BIT(N+1)
for w in W:
    if w > 0:
        w = toid[w]
        if bit.sum(w, bit.n) >= k:
            continue
        else:
            bit.add(w, 1)
    else:
        w = toid[-w]
        if bit.sum(w, w+1) >= 1:
            bit.add(w, -1)
print(bit.sum(0, bit.n))