#include <bits/stdc++.h>

using namespace std;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;

#define all(a)  (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define each(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define exist(s,e) ((s).find(e)!=(s).end())
#define range(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)  range(i,0,n)
#define clr(a,b) memset((a), (b) ,sizeof(a))
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

const double eps = 1e-10;
const double pi  = acos(-1.0);
const ll INF =1LL << 62;
const int inf =1 << 29;

int n,k;

int bit[1<<20];

const int kmax=1000010;
void add(int p,int x){for(int i=p;i<=kmax;i+=i&-i) bit[i]+=x;}
int  sum(int p){int res=0;for(int i=p;i>0;i-=i&-i) res+=bit[i];return res;}


int main(void){
	cin >> n >> k;
	rep(i,n){
		int w;
		cin >> w;
		if(w>0){
			if(sum(kmax)-sum(abs(w)-1)>=k) continue;
			add(abs(w),1);
		}else{
			if(sum(abs(w))-sum(abs(w)-1)==0) continue;
			add(abs(w),-1);
		}
	}
	cout << sum(kmax) << endl;
	return 0;
}