//---------- begin SegmentTree Point update Range query ----------
mod segment_tree {
    pub struct PURQ<T: Clone, F: Fn(T, T) -> T> {
        n: usize,
        a: Vec<T>,
        id: T,
        op: F,
    }
    #[allow(dead_code)]
    impl<T: Clone, F: Fn(T, T) -> T> PURQ<T, F> {
        pub fn new(n: usize, id: T, op: F) -> PURQ<T, F> {
            let mut k = 1;
            while k < n {
                k *= 2;
            }
            PURQ {
                n: k,
                a: vec![id.clone(); 2 * k],
                id: id,
                op: op,
            }
        }
        pub fn update(&mut self, x: usize, v: T) {
            let mut k = self.n + x;
            let a = &mut self.a;
            a[k] = v;
            k >>= 1;
            while k > 0 {
                a[k] = (self.op)(a[2 * k].clone(), a[2 * k + 1].clone());
                k >>= 1;
            }
        }
        pub fn update_tmp(&mut self, x: usize, v: T) {
            self.a[x + self.n] = v;
        }
        pub fn update_all(&mut self) {
            for k in (1..(self.n)).rev() {
                self.a[k] = (self.op)(self.a[2 * k].clone(), self.a[2 * k + 1].clone());
            }
        }
        pub fn find(&self, mut l: usize, mut r: usize) -> T {
            let mut p = self.id.clone();
            let mut q = self.id.clone();
            l += self.n;
            r += self.n;
            while l < r {
                if (l & 1) == 1 {
                    p = (self.op)(p, self.a[l].clone());
                    l += 1;
                }
                if (r & 1) == 1 {
                    r -= 1;
                    q = (self.op)(self.a[r].clone(), q);
                }
                l >>= 1;
                r >>= 1;
            }
            (self.op)(p, q)
        }
    }
}
//---------- end SegmentTree Point update Range query ----------
//https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

//

fn run() {
    input! {
        n: usize,
        k: usize,
        p: [usize; n],
    }
    let mut imos = vec![0; n + 1];
    let f = |a, b| a + b;
    let mut s = segment_tree::PURQ::new(n, 0, f);
    let mut sum = 0;
    let mut inv = vec![0; n];
    for i in 0..k {
        sum += s.find(p[i], n);
        s.update(p[i], 1);
    }
    inv[0] = sum;
    for i in k..n {
        sum -= s.find(0, p[i - k] + 1) - 1;
        s.update(p[i - k], 0);
        sum += s.find(p[i], n);
        s.update(p[i], 1);
        inv[i + 1 - k] = sum;
    }
    let inv = inv;
    let mut inv1 = vec![0; n];
    {
        let k = k - 1;
        let f = |a, b| a + b;
        let mut s = segment_tree::PURQ::new(n, 0, f);
        let mut sum = 0;
        for i in 0..k {
            sum += s.find(p[i], n);
            s.update(p[i], 1);
        }
        inv1[0] = sum;
        for i in k..n {
            sum -= s.find(0, p[i - k] + 1) - 1;
            s.update(p[i - k], 0);
            sum += s.find(p[i], n);
            s.update(p[i], 1);
            inv1[i + 1 - k] = sum;
        }
    }
    let mut ans = 0;
    let mut id = 1;
    for i in 0..(n - k + 1) {
        if inv[i] == 0 {
            ans += id;
            id = 0;
        } else if i == 0 {
            ans += 1;
        } else {
            if inv[i] == inv1[i] && inv[i - 1] == inv[i] {
            } else {
                ans += 1;
            }
        }
    }
    println!("{}", ans);
}

fn main() {
    run();
}


Measured memory_bytes: 14588