#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}

#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)

ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

template <typename Monoid> struct SegmentTree {
  using F = function<Monoid(Monoid, Monoid)>;

  ll sz;
  vector<Monoid> seg;

  const F f;
  const Monoid M1;

  SegmentTree(ll n, const F f, const Monoid &M1) : f(f), M1(M1) {
    sz = 1;
    while (sz < n)
      sz <<= 1;
    seg.assign(2 * sz, M1);
  }

  void set(ll k, const Monoid &x) { seg[k + sz] = x; }

  void build() {
    for (ll k = sz - 1; k > 0; k--) {
      seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
    }
  }

  void update(ll k, const Monoid &x) {
    k += sz;
    seg[k] = x;
    while (k >>= 1) {
      seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
    }
  }

  Monoid query(ll a, ll b) {
    Monoid L = M1, R = M1;
    for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
      if (a & 1)
        L = f(L, seg[a++]);
      if (b & 1)
        R = f(seg[--b], R);
    }
    return f(L, R);
  }

  Monoid operator[](const ll &k) const { return seg[k + sz]; }
};

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N, K;
  cin >> N >> K;
  SegmentTree<ll> seg_max(
      N + 1, [](ll a, ll b) { return max(a, b); }, 0);
  SegmentTree<ll> seg_min(
      N + 1, [](ll a, ll b) { return min(a, b); }, llINF);
  vl P(N);
  REP(i, N) {
    cin >> P[i];
    seg_max.update(i, P[i]);
    seg_min.update(i, P[i]);
  }
  if (N == K) {
    cout << 1 << endl;
    return 0;
  }

  map<ll, bool> same;
  ll po = 1;
  FOR(i, 1, N) {
    if (P[i - 1] < P[i]) {
      po++;
      if (po >= K)
        same[i] = true;
    } else {
      po = 1;
    }
  }

  ll count = 0;
  FOR(i, K, N) {
    // cout << seg_max.query(i - K, i + 1) << "," << seg_min.query(i - K, i + 1)
    //<< "," << P[i - K] << "," << P[i] << endl;
    if (same.find(i - 1) != same.end() && same.find(i) != same.end())
      continue;
    if (seg_min.query(i - K, i + 1) == P[i - K] &&
        seg_max.query(i - K, i + 1) == P[i])
      count++;
  }
  if (same.size() <= 1) {
    cout << N - K + 1 - count << endl;
  } else {
    cout << (N - K + 1 - count - (same.size() - 1)) << endl;
  }

  return 0;
}


Measured memory_bytes: 22528