from collections import Counter

def can_sort_with_k_swaps(N, K, S, T):
    for r in range(K):
        s_group = [S[i] for i in range(N) if i % K == r]
        t_group = [T[i] for i in range(N) if i % K == r]
        if Counter(s_group) != Counter(t_group):
            return False
    return True

def main():
    import sys
    input = sys.stdin.read
    data = input().split()

    N = int(data[0])
    K = int(data[1])
    S = data[2:N+2]
    T = data[N+2:]

    print("Yes" if can_sort_with_k_swaps(N, K, S, T) else "No")

main()