#include<iostream>
#include<vector>
#include<algorithm>

int contena[1000001];

int main(){
	//std::vector<int> contena;
	int n, k;
	std::cin >> n >> k;
	int m = 0;
	int d = 0;
	for (int i = 0; i < n; ++i){
		int w;
		std::cin >> w;
		m = std::max(m, w);
		if (w > 0){
			int cnt = 0;
			for (int j = m; j >w; --j){
				if (contena[j] != 0)cnt+=contena[j];
			}
			if (cnt < k)contena[w]++;
		}
		else{
			if (contena[-w] != 0)contena[-w]--;
			//contena.erase(std::remove(contena.begin(), contena.end(), -w),contena.end());
		}
	}
	int ans = 0;
	for (int i = 1; i < m; ++i){
		if (contena[i] != 0)ans += contena[i];
	}
	std::cout << ans << std::endl;
	return 0;
}