#include <iostream>
#include <vector>
#include <functional>
using namespace std;

template <typename T>
struct binary_indexed_tree { // on monoid
    vector<T> a;
    T unit;
    function<T (T,T)> append; // associative
    template <typename F>
    binary_indexed_tree(size_t n, T a_unit, F a_append) : a(n, a_unit), unit(a_unit), append(a_append) {}
    void point_append(size_t i, T w) { // a[i] += w
        for (size_t j = i+1; j <= a.size(); j += j & -j) a[j-1] = append(a[j-1], w);
    }
    int initial_range_concat(size_t i) { // sum [0, i)
        T acc = unit;
        for (size_t j = i; 0 < j; j -= j & -j) acc = append(acc, a[j-1]);
        return acc;
    }
    T point_get(size_t i) {
        return initial_range_concat(i+1) - initial_range_concat(i);
    }
};

const int w_max = 100000;
int main() {
    int n, k; cin >> n >> k;
    binary_indexed_tree<int> bit(w_max+1, int(), plus<int>());
    while (n --) {
        int w; cin >> w;
        int i = w_max - abs(w);
        if (w > 0) {
            if (bit.initial_range_concat(i+1) < k) {
                bit.point_append(i, 1);
            }
        } else if (w < 0) {
            if (bit.point_get(i)) {
                bit.point_append(i, -1);
            }
        }
    }
    cout << bit.initial_range_concat(w_max) << endl;
    return 0;
}