#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit32(x) (1 << (x))
#define bit64(x) (1ll << (x))

using namespace std;

using i64 = long long;
using f80 = long double;
using vi32 = vector<int>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << endl; exit(0); }
inline void no() { cout << "No" << endl; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); return a / gcd(a, b) * b; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { x = max(x, y); }
template <typename T> inline void amin(T &x, T y) { x = min(x, y); }
template <typename T> inline T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }

struct UnionFind {
  vector<int> data;
  UnionFind(int n) {
    data.assign(n, -1);
  }
  int root(int k) {
    if (data[k] < 0) return k;
    return data[k] = root(data[k]);
  }
  bool unite(int x, int y) {
    x = root(x), y = root(y);
    if (x == y) return false;
    if (data[x] > data[y]) swap(x, y);
    data[x] += data[y];
    data[y] = x;
    return true;
  }
  int size(int k) {
    return -data[root(k)];
  }
};

void solve() {
  int N, K;
  cin >> N >> K;
  UnionFind uf(N - K + 1);
  vi32 P(N);
  cin >> P;
  {
    vi32 acc(N);
    rep(i, N - 1) {
      if (P[i] < P[i + 1]) {
        acc[i + 1] = acc[i] + 1;
      } else {
        acc[i + 1] = acc[i] - 1;
      }
    }
    vi32 lst;
    for (int i = 0; i + K <= N; i++) {
      if (acc[i + K - 1] - acc[i] == K - 1) {
        lst.emplace_back(i);
      }
    }
    rep(i, lst.size() - 1) {
      uf.unite(lst[i], lst[i + 1]);
    }
  }
  deque<int> minq, maxq;
  for (int i = 0; i + 1 <= N; i++) {
    while (minq.size() && P[minq.back()] > P[i]) {
      minq.pop_back();
    }
    while (maxq.size() && P[maxq.back()] < P[i]) {
      maxq.pop_back();
    }
    minq.push_back(i);
    maxq.push_back(i);
    if (i < K) {
      continue;
    }
    if (minq.front() == i - K && maxq.front() == i) {
      uf.unite(i - K, i - K + 1);
    }
    if (minq.front() == i - K) minq.pop_front();
    if (maxq.front() == i - K) maxq.pop_front();
  }
  vi32 flag(N - K + 1);
  rep(i, N - K + 1) flag[uf.root(i)] = 1;
  int ans = 0;
  rep(i, N - K + 1) ans += flag[i];
  cout << ans << endl;
}


Measured memory_bytes: 3832