#include <bits/stdc++.h>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define ALL(c) (c).begin(), (c).end()
int main() 
{
  
  int N, K; cin >> N >> K;
  vector<int> vec;
  rep(i, N) {
    int W; cin >> W;
    if(W > 0) {
      auto iter = lower_bound(ALL(vec), W);
      int size = (int)vec.size() - (iter-vec.begin());
      if(size >= K) { continue; }
      vec.insert(iter, W);
    }
    else {
      auto iter = lower_bound(ALL(vec), -W);
      if(iter == vec.end()) { continue; }
      if(*iter != -W) { continue; }
      vec.erase(iter);
    }
  }
  
  cout << vec.size() << endl;
  
  return 0;
}