def main():
    N, K = map(int, input().split())
    S = [input() for _ in range(N)]
    T = [input() for _ in range(N)]
    
    print(can_rearrange(S, T, N, K))

def can_rearrange(S, T, N, K):
    positions_in_T = {}
    for i in range(N):
        positions_in_T[T[i]] = i + 1
    
    parent = list(range(N+1))
    
    def find(x):
        if parent[x] != x:
            parent[x] = find(parent[x])
        return parent[x]
    
    def union(x, y):
        parent[find(x)] = find(y)
    
    for i in range(1, N-K+1):
        union(i, i+K)
    
    for i in range(N):
        username = S[i]
        initial_position = i + 1
        desired_position = positions_in_T[username]
        if find(initial_position) != find(desired_position):
            return "No"
    
    return "Yes"

if __name__ == "__main__":
    main()