#include<cstdio>
#include<vector>
#define rep(i,a) for(int i=0;i<(a);++i)

const int MAX_W = 1000000;

template<class T>
class fwTree
{
	std::vector<T> bit;

public:

	fwTree( std::size_t sz )
	:	bit(sz)
	{}

	void add( int i, T x )
	{
		for( ; i <= bit.size(); i += i&-i )
			bit[i] += x;

		return;
	}

	T sum( int i )
	{
		T ret = 0;

		for( ; i > 0; i -= i&-i )
			ret += bit[i];

		return ret;
	}

	T sum( int l, int r )
	{ return sum(r)-sum(l-1); }
};

int N, K;
fwTree<int> fwt( MAX_W+1 );

int main()
{
	scanf( "%d%d", &N, &K );
	rep( i, N )
	{
		int W;
		scanf( "%d", &W );

		if( W > 0 )
		{
			if( fwt.sum( W, MAX_W ) >= K )
				continue;

			fwt.add( W, 1 );
		}
		else if( fwt.sum( -W, -W ) )
			fwt.add( -W, -1 );
	}

	printf( "%d\n", fwt.sum( 1, MAX_W ) );

	return 0;
}