def can_rearrange_members(n, k, s_list, t_list):
    from collections import defaultdict

    s_groups = defaultdict(list)
    t_groups = defaultdict(list)

    for i in range(n):
        s_groups[i % k].append(s_list[i])
        t_groups[i % k].append(t_list[i])

    for mod in range(k):
        if sorted(s_groups[mod]) != sorted(t_groups[mod]):
            return "No"
    
    return "Yes"

# Input Reading
def main():
    import sys
    input = sys.stdin.read
    data = input().splitlines()
    
    n, k = map(int, data[0].split())
    s_list = data[1:n+1]
    t_list = data[n+1:]
    
    print(can_rearrange_members(n, k, s_list, t_list))

if __name__ == "__main__":
    main()