import sys
from collections import defaultdict

def main():
    # Read input
    input = sys.stdin.read().split()
    ptr = 0
    N = int(input[ptr])
    ptr += 1
    K = int(input[ptr])
    ptr += 1
    
    S = input[ptr:ptr+N]
    ptr += N
    T = input[ptr:ptr+N]
    ptr += N
    
    # Create groups for S and T based on residue modulo K
    s_groups = defaultdict(list)
    t_groups = defaultdict(list)
    
    for i in range(N):
        pos = i + 1  # 1-based position
        r = pos % K
        s_groups[r].append(S[i])
    
    for i in range(N):
        pos = i + 1  # 1-based position
        r = pos % K
        t_groups[r].append(T[i])
    
    # Check each group
    for r in s_groups:
        if sorted(s_groups[r]) != sorted(t_groups.get(r, [])):
            print("No")
            return
    
    # Also check if T has any groups not present in S (though T is a permutation of S per problem statement)
    for r in t_groups:
        if sorted(t_groups[r]) != sorted(s_groups.get(r, [])):
            print("No")
            return
    
    print("Yes")

if __name__ == "__main__":
    main()