using System;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;

internal partial class Solver {
    public void Run() {
        var N = ni();
        var K = ni();
        var P = ni(N);

        long ans = 0;

        if (K == N) {
            ans = 1;
        } else {
            var slideMax = GetSlideMax(P, K);
            var slideMin = GetSlideMin(P, K);
            var isIncreasing = new long[N - 1];
            for (int i = 0; i < N - 1; i++) {
                isIncreasing[i] = (P[i] < P[i + 1]) ? 1 : 0;
            }
            var isIncreasingTable = new SumTable(isIncreasing);
            bool existOrdered = false;
            for (int i = 0; i < slideMax.Length; i++) {
                if (isIncreasingTable.Sum(i, i + K - 1) == K - 1) { // ordered
                    existOrdered = true;
                    continue;
                }
                if (i > 0) {
                    if (slideMin[i - 1] == P[i - 1] && slideMax[i] == P[i + K - 1]) {

                    } else {
                        ans++;
                    }
                } else {
                    ans++;
                }
            }
            if (existOrdered) ans++;

        }
        cout.WriteLine(ans);
    }

    public class SumTable {
        private readonly long[] sumArray;
        public SumTable(long[] array) {
            sumArray = new long[array.Length + 1];
            Array.Copy(array, 0, sumArray, 1, array.Length);
            for (int i = 1; i < sumArray.Length; i++) {
                sumArray[i] += sumArray[i - 1];
            }
        }

        public long Sum(int begin, int end) {
            return sumArray[end] - sumArray[begin];
        }
    }

    public static T[] GetSlideMin<T>(T[] a, int k) where T : IComparable<T> {
        int n = a.Length;
        if (n < k) {
            throw new ArgumentException();
        }

        var b = new T[n - k + 1];
        int[] deq = new int[n];
        int s = 0, t = 0;
        for (int i = 0; i < n; i++) {
            while (s < t && a[deq[t - 1]].CompareTo(a[i]) >= 0) {
                t--;
            }

            deq[t++] = i;
            if (i - k + 1 >= 0) {
                b[i - k + 1] = a[deq[s]];
                if (deq[s] == i - k + 1) {
                    s++;
                }
            }
        }
        return b;
    }

    public static T[] GetSlideMax<T>(T[] a, int k) where T : IComparable<T> {
        int n = a.Length;
        if (n < k) {
            throw new ArgumentException();
        }

        var b = new T[n - k + 1];
        int[] deq = new int[n];
        int s = 0, t = 0;
        for (int i = 0; i < n; i++) {
            while (s < t && a[deq[t - 1]].CompareTo(a[i]) <= 0) {
                t--;
            }

            deq[t++] = i;
            if (i - k + 1 >= 0) {
                b[i - k + 1] = a[deq[s]];
                if (deq[s] == i - k + 1) {
                    s++;
                }
            }
        }
        return b;
    }
}

// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main(string[] args) {
#if LOCAL
        new Solver(Console.In, Console.Out).Run();
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

namespace cslib.Extensions {
    public static class LinqPadExtension {
        public static T Dump<T>(this T obj) {
#if LOCAL
            return LINQPad.Extensions.Dump(obj);
#else
            return obj;
#endif
        }
    }
}
public class Scanner {
    private readonly TextReader Reader;
    private readonly Queue<string> TokenQueue = new Queue<string>();
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return int.Parse(Next(), ci); }
    public long NextLong() { return long.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (TokenQueue.Count == 0) {
            if (!StockTokens()) {
                throw new InvalidOperationException();
            }
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext() {
        if (TokenQueue.Count > 0) {
            return true;
        }

        return StockTokens();
    }

    private static readonly char[] _separator = new[] { ' ' };
    private bool StockTokens() {
        while (true) {
            string line = Reader.ReadLine();
            if (line == null) {
                return false;
            }

            string[] tokens = line.Split(_separator, StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) {
                continue;
            }

            foreach (string token in tokens) {
                TokenQueue.Enqueue(token);
            }

            return true;
        }
    }
}


Measured memory_bytes: 39804