from collections import defaultdict def main(): import sys input = sys.stdin.read().split() idx = 0 N, k = int(input[idx]), int(input[idx+1]) idx +=2 A = list(map(int, input[idx:idx+N])) idx +=N B = list(map(int, input[idx:idx+N])) # Check if A and B are permutations count = defaultdict(int) for a in A: count[a] +=1 for b in B: count[b] -=1 if count[b] <0: print("No") return for v in count.values(): if v !=0: print("No") return if k ==1 or k ==2: print("Yes") return if N