from collections import defaultdict, Counter

def can_sort(N, K, S, T):
    mod_k_members_s = [set() for _ in range(N)]
    mod_k_members_t = [set() for _ in range(N)]
    for i in range(N):
        mod_k_members_s[i % K].add(S[i])
        mod_k_members_t[i % K].add(T[i])
    
    for i in range(K):
        for j in mod_k_members_s[i]:
            if j not in mod_k_members_t[i]:
                return False
    return True
n, k = map(int, input().split())
s = [input() for _ in range(n)]
t = [input() for _ in range(n)]

if can_sort(n, k, s, t):
    print("Yes")
else:
    print("No")