HMOD = 1145141919810011

N, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))

if A == B:
    exit(print("Yes"))
if N < K or sorted(A) != sorted(B):
    exit(print("No"))
if N == K:
    if A[::-1] == B:
        print("Yes")
    else:
        print("No")
    exit()
if K+2 <= N:
    exit(print("Yes"))

base = 10**6

def func(A, B):
    hashA = 0
    hashB = 0
    for a in A[::-1]:
        hashA = (hashA*base+a)%HMOD
    for b in B[::-1]:
        hashB = (hashB*base+b)%HMOD
    inv = pow(base, -1, HMOD)
    n = pow(base, N-1, HMOD)
    for i in range(N):
        if hashA == hashB:
            return True
        hashA -= A[i]
        hashA %= HMOD
        hashA *= inv
        hashA %= HMOD
        hashA += A[i]*n%HMOD
        hashA %= HMOD
    return False

print("Yes" if func(A, B) or func(A[::-1], B) else "No")