import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N, K;
int[] W;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      K = readInt();
      W = new int[N];
      foreach (i; 0 .. N) {
        W[i] = readInt();
      }
      
      int sz0, sz1;
      auto rbt0 = new RedBlackTree!(int, "a > b", true)();
      auto rbt1 = new RedBlackTree!(int, "a > b", true)();
      foreach (i; 0 .. N) {
        if (W[i] > 0) {
          if (sz0 >= K && rbt0.back >= W[i]) {
            // ignore
          } else {
            ++sz0;
            rbt0.insert(W[i]);
            if (sz0 > K) {
              ++sz1;
              rbt1.insert(rbt0.back);
              --sz0;
              rbt0.removeBack;
            }
          }
        } else {
          if (rbt0.removeKey(-W[i])) {
            --sz0;
            if (sz0 < K && sz1 > 0) {
              ++sz0;
              rbt0.insert(rbt1.front);
              --sz1;
              rbt1.removeFront;
            }
          } else if (rbt1.removeKey(-W[i])) {
            --sz1;
          }
        }
      }
      writeln(sz0 + sz1);
    }
  } catch (EOFException e) {
  }
}