#include <bits/stdc++.h>
using namespace std;
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))

int main(){
    int N, K;
    cin >> N >> K;
    vector<int> v;
    REP(i,N){
        int W; cin >> W;
        if(W<0){
            auto it = lower_bound(v.begin(), v.end(), -W);
            if(it == v.end()) continue;
            if(*it == -W){
                v.erase(it);
            }
        } else {
            auto it = lower_bound(v.begin(), v.end(), W);
            int n = it-v.begin();
            if(v.size()-n < K){
                cerr << W << ":" << v.size()-n << endl;
                v.insert(it, W);
            }
        }
    }
    cout << v.size() << endl;
    return 0;
}