//yuki59.cpp
//Wed Jan  8 22:21:38 2020

#include <iostream>
#include <string>
#include <queue>
#include <map>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#define INTINF 2147483647
#define LLINF 9223372036854775807
using namespace std;
using ll=long long;
typedef pair<int,int> P;

int nodenum,seg[400000];

void init(int n){
	nodenum = 1;
	while (nodenum<n){
		nodenum*=2;
	}
	fill(seg,seg+nodenum,0);
}

void add(int index, int num){
	index += nodenum-1;
	if (num==1){
		seg[index]++;
	}else if (seg[index]>0){
		seg[index]--;
	}
	while(index>0){
		index = (index-1)/2;
		seg[index] = seg[index*2+1]+seg[index*2+2];
	}
}

int query(int a, int b, int k, int l, int r){
	if (r<=a || b<=l){
		return 0;
	}
	if (a<=l && r<=b){
		return seg[k];
	}else {
		int v1 = query(a,b,k*2+1,l,(l+r)/2);
		int v2 = query(a,b,k*2+2,(l+r)/2,r);
		return v1+v2;
	}
}

int main(){
	int n,k;
	cin >> n >> k;

	int w[n];
	vector<int> weight;
	for (int i=0;i<n;i++){
		cin >> w[i];
		weight.push_back(abs(w[i]));
	}

	sort(weight.begin(),weight.end());
	weight.erase(unique(weight.begin(),weight.end()),weight.end());

	map<int,int> mp;
	for (int i=0;i<weight.size();i++){
		mp[weight[i]] = i;
	}

	init(weight.size());

	for (int i=0;i<n;i++){
		if (w[i]<0){
			add(mp[abs(w[i])],-1);
		}else {
			int thres = query(mp[w[i]],nodenum,0,0,nodenum);
			if (thres<k){
				add(mp[w[i]],1);
			}
		}
	}

	cout << query(0,nodenum,0,0,nodenum) << endl;
}