def main():
    import sys
    input = sys.stdin.read
    data = input().split()
    idx = 0
    N = int(data[idx])
    idx += 1
    k = int(data[idx])
    idx += 1
    A = list(map(int, data[idx:idx+N]))
    idx += N
    B = list(map(int, data[idx:idx+N]))
    
    if sorted(A) != sorted(B):
        print("No")
        return
    
    if A == B:
        print("Yes")
        return
    
    if k <= 2:
        print("Yes")
        return
    
    if k % 2 == 0:
        print("Yes")
        return
    
    # Compute the permutation's parity
    pos_in_B = {num: idx for idx, num in enumerate(B)}
    visited = [False] * N
    parity = 0
    
    for i in range(N):
        if not visited[i]:
            cycle_length = 0
            j = i
            while not visited[j]:
                visited[j] = True
                j = pos_in_B[A[j]]
                cycle_length += 1
            parity += (cycle_length - 1)
    
    if parity % 2 == 0:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main()