import java.util.TreeSet;

public class Main {

  private static void solve() {
    int n = ni();
    int k = ni();
    int[] p = na(n);
    System.out.println(solve(p, k));

  }


  private static int solve(int[] p, int k) {
    int n = p.length;
    TreeSet<Integer> set = new TreeSet<>();
    for (int i = 0; i < k; i++) {
      set.add(p[i]);
    }

    int inc = 1;
    boolean[] flg = new boolean[n];
    for (int i = 1; i < n; i++) {
      if (p[i - 1] < p[i]) {
        inc++;
      } else {
        inc = 1;
      }

      if (inc >= k) {
        flg[i] = true;
      }
    }



    int cnt = flg[k - 1] ? 0 : 1;
    for (int i = k; i < n; i++) {
      if (!flg[i]) {
        if (set.higher(p[i]) != null || set.lower(p[i - k]) != null) {
          cnt++;
        }
      }
      set.add(p[i]);
      set.remove(p[i - k]);
    }

    for (boolean b : flg) {
      if (b) {
        cnt++;
        break;
      }
    }
    return cnt;
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}



Measured memory_bytes: 58976