import sys; input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
con = 10 ** 9 + 7; INF = float("inf")

def getlist():
	return list(map(int, input().split()))

class SegmentTree(object):
	#N:処理する区間の長さ
	def __init__(self, N):
		self.N0 = 2 ** (N - 1).bit_length()
		self.data = [0] * (2 * self.N0)

	#k番目の値をxに更新
	def update(self, k, x):
		k += self.N0 - 1
		self.data[k] = x
		while k > 0:
			k = (k - 1) // 2
			self.data[k] = self.data[2 * k + 1] + self.data[2 * k + 2]

	# 区間和
	def query(self, l, r):
		L = l + self.N0; R = r + self.N0 + 1
		m = 0
		while L < R:
			if R & 1:
				R -= 1
				m += self.data[R - 1]
			if L & 1:
				m += self.data[L - 1]
				L += 1
			L >>= 1; R >>= 1

		return m

#処理内容
def main():
	N, K = getlist()
	Seg = SegmentTree(10 ** 6 + 1)
	for i in range(N):
		W = int(input())
		if W < 0:
			val = Seg.query(-W, -W)
			if val >= 1:
				Seg.update(-W, val - 1)

		else:
			val = Seg.query(W, 10 ** 6)
			if val < K:
				num = Seg.query(W, W)
				Seg.update(W, num + 1)


	ans = Seg.query(0, 10 ** 6)
	print(ans)

if __name__ == '__main__':
	main()