#![allow(unused_imports)]
#![allow(non_snake_case)]
use std::collections::HashMap;
use std::collections::HashSet;
use std::collections::VecDeque;

#[allow(unused_macros)]
macro_rules! read {
    ([$t:ty] ; $n:expr) =>
        ((0..$n).map(|_| read!([$t])).collect::<Vec<_>>());
    ($($t:ty),+ ; $n:expr) =>
        ((0..$n).map(|_| read!($($t),+)).collect::<Vec<_>>());
    ([$t:ty]) =>
        (rl().split_whitespace().map(|w| w.parse().unwrap()).collect::<Vec<$t>>());
    ($t:ty) =>
        (rl().parse::<$t>().unwrap());
    ($($t:ty),*) => {{
        let buf = rl();
        let mut w = buf.split_whitespace();
        ($(w.next().unwrap().parse::<$t>().unwrap()),*)
    }};
}

#[allow(dead_code)]
fn rl() -> String {
    let mut buf = String::new();
    std::io::stdin().read_line(&mut buf).unwrap();
    buf.trim_end().to_owned()
}

fn main() {
    let (_, k) = read!(usize, u64);
    let mut d = vec![0];
    d.append(&mut read!([usize]));

    let mut ans = 0;
    for i in 1..d.len() {
        if d[i] != i {
            let mut l = 1;
            let mut j = d[i];
            d[i] = i;
            while d[j] != i {
                let new_j = d[j];
                d[j] = j;
                j = new_j;
                l += 1;
            }
            d[j] = j;
            ans += l;
        }
    }

    if k < ans {
        println!("NO");
    } else if (k - ans) % 2 == 0 {
        println!("YES");
    } else {
        println!("NO");
    }
}