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

int w[1000000];
int a[1000000];
int c[1000000];

int main() {
  int n,k;
  while(scanf("%d%d",&n,&k) == 2) {
    REP(i,n) {
      c[i] = 0;
      scanf("%d", w+i);
      a[i] = abs(w[i]);
    }
    sort(a,a+n);
    int m = unique(a,a+n) - a;
    REP(i,n) {
      if (w[i]>0) {
        int id = lower_bound(a,a+m,w[i]) - a;
        int sm = 0;
        for (int j=id; j<m; ++j) sm += c[j];
        if (sm < k) c[id]++;
      } else {
        int id = lower_bound(a,a+m,-w[i]) - a;
        if (c[id]) c[id]--;
      }
    }
    int ans = 0;
    REP(i,n) ans+=c[i];
    cout << ans << endl;
  }
}