#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

#include<atcoder/segtree>
int op(int a,int b){
    return a + b;
}
int e(){
    return 0;
}
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n,k;
    cin>>n>>k;
    vector<ll> w(n),dx;
    for(int i = 0;i<n;i++){
        cin>>w[i];
        dx.push_back(abs(w[i]));
    }
    sort(dx.begin(),dx.end());
    dx.erase(unique(dx.begin(),dx.end()),dx.end());
    int m = dx.size();
    atcoder::segtree<int,op,e> seg(m);
    for(int i = 0;i<n;i++){
        ll now = abs(w[i]);
        int ni = lower_bound(dx.begin(),dx.end(),now) - dx.begin();
        if(w[i]>0){
            int use = seg.prod(ni,m);;
            if(use>=k) continue;
            seg.set(ni,seg.get(ni)+1);
        }else{
            int use = seg.get(ni);
            use--;
            if(use<0) use = 0;
            seg.set(ni,use);
        }
    }
    cout<<seg.all_prod()<<endl;
}