package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

func out(x ...interface{}) {
	fmt.Println(x...)
}

var sc = bufio.NewScanner(os.Stdin)

func getInt() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func getInts(N int) []int {
	ret := make([]int, N)
	for i := 0; i < N; i++ {
		ret[i] = getInt()
	}
	return ret
}

func getString() string {
	sc.Scan()
	return sc.Text()
}

// min, max, asub, absなど基本関数
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func asub(a, b int) int {
	if a > b {
		return a - b
	}
	return b - a
}

func abs(a int) int {
	if a >= 0 {
		return a
	}
	return -a
}

func lowerBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] >= x
	})
	return idx
}

func upperBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] > x
	})
	return idx
}

func main() {
	sc.Split(bufio.ScanWords)
	N, K := getInt(), getInt()
	w := getInts(N)

	q := make([]int, 0)
	for i := 0; i < N; i++ {
		// out("w=", w[i])
		if w[i] < 0 {
			x := lowerBound(q, -w[i])
			// out(x)
			if x < len(q) && q[x] == -w[i] {
				// out("down", q, -w[x], x)
				q = append(q[:x], q[x+1:]...)
			}
		} else {
			x := lowerBound(q, w[i])
			if len(q)-x < K {
				// out(x, len(q))
				// if len(q) == 0 {
				// 	q = append(q, w[i])
				// } else {
				q = append(q[:x],
					append([]int{w[i]}, q[x:]...)...)
				// }
				//sort.Ints(q)
			}
		}
		// out(q)
	}
	out(len(q))
}