#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for(int i = a; i < b; i++)
#define rrep(i, a, b) for(int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
#define pii pair<int,int>
#pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define isSquare(x) (sqrt(x)*sqrt(x) == x)
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(a>b){a = b; return 1;} return 0; };
inline void IN(void){return;}
template <typename First, typename... Rest> void IN(First& first, Rest&... rest){cin >> first;IN(rest...);return;}
inline void OUT(void){cout << "\n";return;}
template <typename First, typename... Rest> void OUT(First first, Rest... rest){cout << first << " ";OUT(rest...);return;}
const double EPS = 1e-9;
const int mod = 1e9 + 7;
const int INF = 1e9;
const long long LLINF = 1e18;
long long lcm(ll a, ll b){return a * b / __gcd(a,b);}
struct IoSetup { IoSetup() {
    cin.tie(nullptr);ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
} } iosetup;
template< int mod > struct ModInt {
    int x; ModInt() : x(0) {}
    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    ModInt &operator+=(const ModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;}
    ModInt &operator-=(const ModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;}
    ModInt &operator*=(const ModInt &p) {x = (int) (1LL * x * p.x % mod);return *this;}
    ModInt &operator/=(const ModInt &p) {*this *= p.inverse();return *this;}
    ModInt operator-() const { return ModInt(-x); }
    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
    bool operator==(const ModInt &p) const { return x == p.x; }
    bool operator!=(const ModInt &p) const { return x != p.x; }
    ModInt inverse() const {int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); }return ModInt(u);}
    ModInt pow(int64_t n) const {ModInt ret(1), mul(x); while(n > 0) {if(n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}
    friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x;}
    friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); }
    static int get_mod() { return mod; }
}; using modint = ModInt< mod >;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

vector<int> slide_min(vector<int> a, int k){
    // 最小値となりうるaのインデックスを保持
    int n = a.size();
    deque<int> deq;
    vector<int> b(n - k + 1);
    for(int i = 0; i < k; i++){
        while(!deq.empty() && a[deq.back()] >= a[i]) deq.pop_back();
        deq.push_back(i);
    }

    for(int i = 0; i <= n - k; i++){
        b[i] = a[deq.front()];
        if(i != n - k){
            while(!deq.empty() && a[deq.back()] >= a[i + k]) deq.pop_back();
            deq.push_back(i + k);
        }
        if(i == deq.front()) deq.pop_front();
    }
    return b;
}

int main(){
    iosetup;
    int N, K; cin >> N >> K;
    vector<int> P(N), mP(N);
    int ans = N - K + 1;
    rep(i, 0, N){
        cin >> P[i];
        mP[i] = -P[i];
    }
    vector<int> S(N, 1);
    rep(i, 0, N - 1){
        if(P[i] < P[i+1]) S[i+1] = S[i] + 1;
        else S[i+1] = 1;
    }
    int cnt = 0;
    rep(i, 0, N) if(S[i] >= K) cnt++;
    if(cnt >= 2) ans -= cnt - 1;

    vector<int> MAX = slide_min(mP, K);
    rep(i, 0, N - K + 1) MAX[i] = -MAX[i];
    vector<int> MIN = slide_min(P, K);
    // for(auto e: MAX) cerr << e << " ";
    // cerr << endl;
    // for(auto e: MIN) cerr << e << " ";
    // cerr << endl;
    rep(i, 0, N - K){
        if(MAX[i] != MAX[i+1] && MIN[i] < MIN[i+1]){
            if(S[i+K] >= K);
            else ans--;
        }
    }
    cout << ans << endl;

    return 0;
}

Measured memory_bytes: 4976