#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define mt make_tuple
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;

ll BIT[2*(1<<20)-1],n;
void bit_init(int n_){
  n = 1;
  while(n < n_){
    n *= 2;
  }
  for(int i = 0; i < 2 * n - 1 ; i++){
    BIT[i] = 0;
  }
}


ll sum(int i){
  ll s = 0;
  while(i > 0){
    s += BIT[i];
    i -= (i & -i);
  }
  return s;
}

void add (int i,int x){
  while(i <= n){
    BIT[i] += x;
    i += (i & -i);
  }
}
int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  int N,K;
  cin >> N >> K;
  bit_init(1001000);
  int now_max = 0;
  rep(i,N){
    int W;
    cin >> W;
    if(W < 0){
      W = - W;
      ll sum1 = sum(W-1);
      ll sum2 = sum(W);
      //DEBUG2(sum1,sum2);
      if(sum2 - sum1 > 0){
        add(W,-1);
      }
    }else{
      if(now_max < W){
        now_max = W;
        add(W,1);
      }else{
        ll sum1 = sum(W-1);
        ll sum2 = sum(now_max);
        if(sum2-sum1 < K){
          add(W,1);
        }
      }
    }
  }
  cout << sum(now_max) << endl;
  return 0;
}