//効率の悪い解法
#include<iostream>
using namespace std;

int n,k;
int w[10001];

int main(){
	int i,j;
	cin >> n >> k;
	for( i = 0; i < n; i++ ){
		int cnt = 0;
		cin >> w[i];
		if( w[i] > 0 ){
			for( j = 0; j < i; j++ ){
				if( w[j] >= w[i] )
					cnt++;
			}
			if( cnt >= k )
				w[i] = 0;
		}
		else{
			for( j = 0; j < i; j++ ){
				if( w[i] == -w[j] )
					break;
			}
			if( j < i ){
				w[j] = 0;
			}
			w[i] = 0;
		}
	}
	
	int ans = 0;
	for( i = 0; i < n; i++ ){
		if( w[i] )
			ans++;
	}
	cout << ans << endl;
	return 0;
}