import java.util.*

fun main(args: Array<String>) = IO().exec {
    val n = int()
    val k = int()
    val p = IntArray(n){int()}
    val tset = TreeSet<Int>()
    var useInitState = false
    val utree = Utree(n-k+2)
    val INIT_STATE = n-k+1
    for (i in k) tset.add(p[i])
    var cnt = 0
    for (i in k-1) if (p[i] < p[i+1]) cnt++ else cnt=0
    if (cnt >= k-1) {
        useInitState=true
        utree.unite(0, INIT_STATE)
    }
    for (i in k until n) {
        val j = i - k + 1
        if (p[i-1] < p[i]) cnt++ else cnt=0
        if (cnt >= k-1) {
            useInitState = true
            utree.unite(j, INIT_STATE)
        }
        if (p[i] > tset.last() && p[i-k] == tset.first()) {
            utree.unite(j-1, j)
        }
        tset.remove(p[i-k])
        tset.add(p[i])
    }
    if (useInitState) println(utree.size()) else println(utree.size()-1)
}


class Utree(val n: Int) {
    var par = IntArray(n){it}
    var rank = IntArray(n){0}
    var size = IntArray(n){1}

    fun find(x: Int): Int {
        return if (par[x] == x) {
            x
        } else {
            val ret = find(par[x])
            par[x] = ret
            ret
        }
    }

    fun unite(x_: Int, y_: Int) {
        val x = find(x_)
        val y = find(y_)
        if (x == y) return

        if (rank[x] < rank[y]) {
            par[x] = y
            size[y] += size[x]
        } else {
            par[y] = x
            size[x] += size[y]
            if (rank[x] == rank[y]) {
                rank[x]++
            }
        }
    }

    fun isSame(x: Int, y: Int): Boolean {
        return find(x) == find(y)
    }

    fun getSize(x: Int): Int {
        return size[find(x)]
    }

    fun size(): Int {
        val hashSet = HashSet<Int>()
        for (i in 0 until n) hashSet.add(find(i))
        return hashSet.size
    }
}

// region template
operator fun Int.iterator() = 0.until(this).iterator()

class IO {
    val printable = 33..126
    val buffer = ByteArray(1024)
    var ptr = 0
    var buflen = 0
    val out = java.io.PrintWriter(System.out)
    fun hasNextByte(): Boolean = if (ptr < buflen) true else {
        ptr = 0
        buflen = System.`in`.read(buffer)
        buflen > 0
    }

    fun readByte(): Byte = if (hasNextByte()) buffer[ptr++] else -1
    fun hasNext(): Boolean {
        while (hasNextByte() && buffer[ptr] !in printable) ptr++
        return hasNextByte()
    }

    fun string(): String {
        if (!hasNext()) throw java.util.NoSuchElementException()
        val sb = StringBuilder()
        var b = readByte()
        while (b in printable) {
            sb.appendCodePoint(b.toInt())
            b = readByte()
        }
        return sb.toString()
    }

    fun long(): Long {
        if (!hasNext()) throw java.util.NoSuchElementException()
        var n = 0L
        var minus = false
        var b = readByte()
        if (b == '-'.toByte()) {
            minus = true
            b = readByte()
        }
        if (b !in '0'.toByte()..'9'.toByte()) {
            throw NumberFormatException()
        }
        while (true) {
            if (b in '0'.toByte()..'9'.toByte()) {
                n *= 10
                n += b - '0'.toByte()
            } else if (b == (-1).toByte() || b !in printable) {
                return if (minus) -n else n
            } else {
                throw NumberFormatException()
            }
            b = readByte()
        }
    }

    fun int(): Int {
        val nl = long()
        if (nl !in Integer.MIN_VALUE..Integer.MAX_VALUE) throw NumberFormatException()
        return nl.toInt()
    }

    fun double(): Double = string().toDouble()
    fun print(obj: Any) = out.print(obj)
    fun print(i: Int) = out.print(i)
    fun print(l: Long) = out.print(l)
    fun println(obj: Any) = out.println(obj)
    fun println(i: Int) = out.println(i)
    fun println(l: Long) = out.println(l)
    inline fun exec(block: IO.() -> Unit) {
        block()
        out.flush()
    }

    inline fun println(block: IO.() -> Any) {
        println(block())
        out.flush()
    }
}
// endregion