using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Text;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Extentions;

class IO
{
    int idx;
    string[] input = In.ReadToEnd().Split(new[] { " ", "\n", "\r" },
        StringSplitOptions.RemoveEmptyEntries);

    T Get<T>(Func<string, T> parser) => parser(input[idx++]);

    public string S => Get(s => s);
    public char C => Get(char.Parse);
    public int I => Get(int.Parse);
    public long L => Get(long.Parse);
    public double F => Get(double.Parse);
    public decimal D => Get(decimal.Parse);
    public BigInteger B => Get(BigInteger.Parse);

    T[] Gets<T>(int n, Func<string, T> parser)
        => input.Skip((idx += n) - n).Take(n).Select(parser).ToArray();

    public string[] Ss(int n) => Gets(n, s => s);
    public char[] Cs(int n) => Gets(n, char.Parse);
    public int[] Is(int n) => Gets(n, int.Parse);
    public long[] Ls(int n) => Gets(n, long.Parse);
    public double[] Fs(int n) => Gets(n, double.Parse);
    public decimal[] Ds(int n) => Gets(n, decimal.Parse);
    public BigInteger[] Bs(int n) => Gets(n, BigInteger.Parse);

    public void Write<T>(params T[] xs) => WriteLine(string.Join(" ", xs));
    public void Write(params object[] xs) => WriteLine(string.Join(" ", xs));
}

interface IMonoid<T>
{
    T Mempty { get; }
    T Mappend(T a, T b);
}

class IntSumMonoid : IMonoid<int>
{
    public int Mempty => 0;
    public int Mappend(int a, int b) => a + b;
}

class SegmentTree<T>
{
    T[] tree;

    public readonly int N;
    public readonly IMonoid<T> Monoid;

    // O(N)
    public SegmentTree(int n, IMonoid<T> monoid)
    {
        N = 1;
        while (N < n) N *= 2;
        tree = Enumerable.Repeat(monoid.Mempty, N * 2).ToArray();
        Monoid = monoid;
    }

    // O(N)
    public SegmentTree(IEnumerable<T> collection, IMonoid<T> monoid)
    {
        N = 1;
        while (N < collection.Count()) N *= 2;
        tree = new T[N * 2];
        for (var i = 0; i < N; i++)
            tree[i + N] = i < collection.Count() ?
                collection.ElementAt(i) : monoid.Mempty;
        for (var i = N - 1; i > 0; i--)
            tree[i] = monoid.Mappend(tree[i * 2], tree[i * 2 + 1]);
        Monoid = monoid;
    }

    // O(log N)
    public T this[int i]
    {
        get { return tree[i + N]; }
        set
        {
            tree[i += N] = value;
            for (i >>= 1; i > 0; i >>= 1)
                tree[i] = Monoid.Mappend(tree[i * 2], tree[i * 2 + 1]);
        }
    }

    // O(log N)
    public T this[int i, int j]
    {
        get
        {
            var r = Monoid.Mempty;
            i += N;
            j += N + 1;
            for (; i < j; i >>= 1, j >>= 1)
            {
                if ((j & 1) != 0) r = Monoid.Mappend(r, tree[--j]);
                if ((i & 1) != 0) r = Monoid.Mappend(r, tree[i++]);
            }
            return r;
        }
    }
}

static class Extentions
{
}

static class Program
{
    public static void Main()
    {
        var sw = new StreamWriter(OpenStandardOutput()) { NewLine = "\n" };
#if DEBUG
        sw.AutoFlush = true;
#else
        sw.AutoFlush = false;
#endif
        SetOut(sw);
        Solve(new IO());
        Out.Flush();
    }

    static void Solve(IO io)
    {
        const int wMax = 1000000;

        var n = io.I;
        var k = io.I;
        var segtree = new SegmentTree<int>(wMax + 1, new IntSumMonoid());

        for (var i = 0; i < n; i++)
        {
            var w = io.I;
            if (w > 0 && segtree[w, wMax] < k) segtree[w]++;
            if (w < 0 && segtree[-w] > 0) segtree[-w]--;
        }

        io.Write(segtree[0, wMax]);
    }
}