N, K = map(int, raw_input().split())

MX = 1000000
data = [0] * (MX + 1)


def BIT_Add(x, a):
    while x <= MX:
        data[x] += a
        x += x & (-x)


def BIT_Sum(x):
    total = 0
    while x > 0:
        total += data[x]
        x -= x & (-x)
    return total


for _ in xrange(N):
    W = int(raw_input())

    if W > 0:
        W -= 1
        if BIT_Sum(MX - W) < K:
            BIT_Add(MX - W, 1)
    elif W < 0:
        W += 1

        if BIT_Sum(MX + W) - BIT_Sum(MX + W - 1) > 0:
            BIT_Add(MX + W, -1)

print BIT_Sum(MX)