#include <bits/stdc++.h>
using namespace std;
typedef long long   signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for(LL i = (l)    ; i <  (r); ++i)
#define incII(i, l, r) for(LL i = (l)    ; i <= (r); ++i)
#define decID(i, l, r) for(LL i = (r) - 1; i >= (l); --i)
#define decII(i, l, r) for(LL i = (r)    ; i >= (l); --i)
#define inc(i, n)  incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec(i, n)  decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
template<typename T> bool setmin  (T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmax  (T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
LL mo(LL a, LL b) { assert(b > 0); a %= b; if(a < 0) { a += b; } return a; }
LL fl(LL a, LL b) { assert(b > 0); return (a > 0 ? a / b : (a - b + 1) / b); }
LL ce(LL a, LL b) { assert(b > 0); return (a < 0 ? a / b : (a + b - 1) / b); }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define bit(b, i) (((b) >> (i)) & 1)
#define BC __builtin_popcountll
#define SC static_cast
#define SI(v) SC<int>(v.size())
#define SL(v) SC<LL >(v.size())
#define RF(e, v) for(auto & e: v)
#define ef else if
#define UR assert(false)

// ---- ----

template<typename T> class SegmentTree {
private:
	int n, s;
	vector<T> a;
	function<T(T &, T &)> f;
	T e;
	bool ok;
public:
	SegmentTree() { n = 0; }
	SegmentTree(int nn, function<T(T &, T &)> ff, T ee) { init(nn, ff, ee); }
	void init(int nn, function<T(T &, T &)> ff, T ee) {
		n = nn;
		f = ff;
		e = ee;
		s = 1;
		while(s < n) { s *= 2; }
		a = vector<T>(2 * s, e);
		ok = true;
	}
	void shift(int & p) {
		assert(inID(p, 0, n));
		p += s;
	}
	void apply(int p, function<void(T &)> g) {
		shift(p);
		g(a[p]);
		while(p > 1) {
			p /= 2;
			a[p] = f(a[2 * p], a[2 * p + 1]);
		}
	}
	T fold_ID(int l, int r) {
		assert(ok);
		assert(inII(l, 0, n)); l += s;
		assert(inII(r, 0, n)); r += s; r--;
		T x = e, y = e;
		while(l <= r) {
			if(l % 2 == 1) { x = f(x, a[l]); l++; }
			if(r % 2 == 0) { y = f(a[r], y); r--; }
			l /= 2;
			r /= 2;
		}
		return f(x, y);
	}
	T fold_II(int l, int r) { return fold_ID(l + 0, r + 1); }
	T fold_CI(int l, int r) { return fold_ID(l + 1, r + 1); }
	T fold_CD(int l, int r) { return fold_ID(l + 1, r + 0); }
	const T & operator[](int p) {
		shift(p);
		return a[p];
	}
	T & ref(int p) {
		shift(p);
		ok = false;
		return a[p];
	}
	void update() {
		dec(i, s) { a[i] = f(a[2 * i], a[2 * i + 1]); }
		ok = true;
	}
};
#define OP(s) [&](auto & A, auto & B) { return s; }
#define AP(s) [&](auto & A) { s; }

// ---- ----

int n, k;

int main() {
	cin >> n >> k;
	vector<int> p(n);
	inc(i, n) { cin >> p[i]; }
	
	SegmentTree<int> st_min(n, OP(min(A, B)),  n);
	SegmentTree<int> st_max(n, OP(max(A, B)), -1);
	SegmentTree<int> st_sum(n, OP(A + B), 0);
	inc(i, n) {
		st_min.ref(i) = p[i];
		st_max.ref(i) = p[i];
	}
	inc(i, n - 1) {
		st_sum.ref(i) = (p[i] < p[i + 1] ? 0 : 1);
	}
	st_min.update();
	st_max.update();
	st_sum.update();
	
	int ans = n - k + 1, eq = 0;
	inc(i, n - k + 1) {
		bool f0 = (st_sum.fold_ID(i + 0, i + 0 + k - 1) == 0);
		if(f0) { eq++; }
	}
	inc(i, n - k) {
		bool f0 = (st_sum.fold_ID(i + 0, i + 0 + k - 1) == 0);
		bool f1 = (st_sum.fold_ID(i + 1, i + 1 + k - 1) == 0);
		if(f0 && f1) { continue; }
		int mi = st_min.fold_II(i, i + k);
		int ma = st_max.fold_II(i, i + k);
		if(mi == p[i] && ma == p[i + k]) { ans--; }
		// cout << i << ": " << mi << " " << p[i] << "    " << ma << " " << p[i + k] << endl;
	}
	// cout << "eq: " << eq << endl;
	if(eq > 0) { ans -= eq - 1; }
	
	cout << ans << endl;
	
	/*
	inc(i, n - k + 1) {
		vector<int> v = p;
		sort(& v[i], & v[i + k]);
		RF(e, v) { cout << e << " "; } cout << endl;
	}
	*/
	return 0;
}


Measured memory_bytes: 7224