#include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < (a); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a) for (int i = (a) - 1; i >= 0; i--)
#define repr2(i, a, b) for (int i = (b) - 1; i >= (a); i--)
using namespace std;
typedef long long ll;
const ll inf = 1e9;
const ll mod = 1e9 + 7;

struct BIT {
	int size;
	vector<ll> bit;
	BIT(int size) : size(size), bit(size + 1) {}
	void add(int k, ll x) {
		while (k <= size) {
			bit[k] += x;
			k += k & -k;
		}
	}
	ll sum(int k) {
		ll res = 0;
		while (k > 0) {
			res += bit[k];
			k -= k & -k;
		}
		return res;
	}
};

int main() {
	int N, K;
	cin >> N >> K;
	BIT bit(1010101);

	rep (i, N) {
		int W;
		cin >> W;

		if (W > 0) {
			int total = bit.sum(1010000) - bit.sum(W - 1);
			if (total < K) {
				bit.add(W, 1);	
			}
		} else {
			W *= -1;
			if (bit.sum(W) - bit.sum(W - 1) > 0) {
				bit.add(W, -1);
			}
		}
	}

	int ans = bit.sum(1010000);
	cout << ans << endl;
}