use std::collections::HashMap;

use proconio::input;

fn main() {
    input! {
        n: usize, k: usize,
        s: [String; n],
        t: [String; n],
    }

    let mut index = HashMap::new();
    for i in 0 .. n {
        index.insert(t[i].clone(), i);
    }

    let mut ans = vec![0; n];
    for i in 0 .. n.min(k) {
        let mut x = vec![];
        let mut y = vec![];
        for j in (i .. n).step_by(k) {
            x.push(index[&s[j]]);
            y.push(j);
        }
        x.sort();
        for t in 0 .. x.len() {
            ans[y[t]] = x[t];
        }
    }

    if ans.windows(2).all(|x| x[0] <= x[1] ) {
        println!("Yes");
    } else {
        println!("No");
    }
}