#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;

// tourist set
template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// tourist set end

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("YES")
#define p_no() p("NO")
#define pb(s) push_back(s)
#define SZ(x) ((int)(x).size())

void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}

const ll mod = 1e9 + 7;
const ll inf = 1e18;

void vprint(vector<ll> A){
    ll L = A.size();
    FOR(i, 0, L){
        if(i) cout << ' ';
        cout << A[i];
    }
    cout << endl;
}

// ei1333's BIT
struct BinaryIndexedTree {
  VI data;

  BinaryIndexedTree(ll sz) {
    data.assign(++sz, 0);
  }

  ll sum(ll k) {
    ll ret = 0;
    for(++k; k > 0; k -= k & -k) ret += data[k];
    return (ret);
  }

  // iからjまでの和
  ll range_sum(ll i, ll j){
    return sum(j) - sum(i-1);
  }

  void add(ll k, ll x) {
    for(++k; k < data.size(); k += k & -k) data[k] += x;
  }
};

void printSet(set<ll> se){
  VI V;
  for(ll a : se){
    V.push_back(a);
  }
  vprint(V);
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll N, K;
    cin >> N >> K;

    VI A(N);
    rep(i, N){
        cin >> A.at(i);
    }

    ll all = N-K+1;

    ll already_sorted = 0;
    // 大小関係
    auto BIT = BinaryIndexedTree(N);
    rep(i, N-1){
      if(A[i]<A[i+1]){
        BIT.add(i, 1);
      }
    }
    ll equ = 0;

    if(N==K){
      p(1);
      return 0;
    }

    // 以降、K<N
    
    set<ll> se;
    rep(i, K+1){
      se.insert(A[i]);
    }
    // printSet(se);

    debug(A[0]);
    debug(A[K]);
    debug(equ);
    debug(*se.begin());
    debug(*se.rbegin());

    rep(i, N-K+1){
      if(BIT.range_sum(i, i+K-2)==K-1){
        already_sorted++;
      }else{
        // ソートされていない時
        if(i==0){
          // 初回分
          if(A[0]==*se.begin() && A[K]==*se.rbegin()){
            equ++;
          }
        }
        // i, i+1がequivalentか
        else{
          if(i+K>=N) continue;

          debug(i);
          if(A[i]==*se.begin() && A[i+K]==*se.rbegin()){
            equ++;
            debug("+");
          }

        }
      }
      // se
      se.erase(A[i]);
      se.insert(A[i+K+1]);
          
    }

    
    // debug(already_sorted);
    if(already_sorted){
      all -= already_sorted-1;
    }
    if(equ){
      all -= equ;  
    }

    p(all);
    
    return 0;
}

Measured memory_bytes: 12672