#include<bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

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

  int sz;
  vector< Monoid > seg;

  const F f;
  const Monoid M1;

  SegmentTree(int 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(int k, const Monoid &x) {
    seg[k + sz] = x;
  }

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

  void update(int 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(int a, int 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 int &k) const {
    return seg[k + sz];
  }
};


int main() {
  int N, K;
  cin >> N >> K;
  vector< int > P(N);
  cin >> P;

  auto f1 = [](int a, int b) { return min(a, b); };
  auto f2 = [](int a, int b) { return max(a, b); };
  SegmentTree< int > seg1(N, f1, inf), seg2(N, f2, -inf);
  for(int i = 0; i < N; i++) {
    seg1.set(i, P[i]);
    seg2.set(i, P[i]);
  }
  seg1.build();
  seg2.build();


  vector< int > latte(N), malta(N);
  for(int i = 1; i < N; i++) latte[i] = P[i - 1] < P[i];
  for(int i = 0; i + 1 < N; i++) malta[i] = P[i] < P[i + 1];
  for(int i = 1; i < N; i++) {
    if(P[i - 1] < P[i]) {
      latte[i] += latte[i - 1];
    }
  }
  for(int i = N - 2; i >= 0; i--) {
    if(P[i] < P[i + 1]) malta[i] += malta[i + 1];
  }

  set< pair< int, int > > st;
  for(int i = 0; i + K <= N; i++) {
    int low = seg1.query(i, i + K);
    int high = seg2.query(i, i + K);

    int uku = latte[i + K - 1] - latte[i];
    if(uku + 1 == K) {
      st.emplace(-1, -1);
      continue;
    }
    if(i > 0 && P[i - 1] < low) low = i - 1 - latte[i - 1];
    else low = i;
    if(i + K < N && high < P[i + K]) high = i + K + 1 + malta[i + K];
    else high = i + K;
    st.emplace(low, high);
  }
  cout << st.size() << endl;
}

Measured memory_bytes: 16128