n, k = map(int, input().split())
l = n-k
s = [input() for _ in range(n)]
t = [input() for _ in range(n)]

for i in range(k):
    p = s[i::k]
    q = t[i::k]
    p.sort()
    q.sort()
    if p != q:
        print("No")
        break
else:
    print("Yes")