n, k = map(int, input().split()) s = [] t = [] for i in range(n): s.append(input()) for i in range(n): t.append(input()) possible = True for i in range(k): s_group = [] t_group = [] for j in range(i, n, k): s_group.append(s[j]) t_group.append(t[j]) if sorted(s_group) != sorted(t_group): possible = False break print("Yes" if possible else "No")