import numpy as np

n, l = map(int, input().split())
d = list(map(int, input().split()))
D = []

for e in d:
	D.append(e)

for e in d:
	D.append(l + e)

b = list(map(int, input().split()))
A = np.zeros((2 * n, 2 * n))

for i in range(2 * n):
	for j in range(i):
		if i - j <= n:
			A[i][j] = D[i] - D[j]
		else:
			A[i][j] = 2 * l - (D[i] - D[j])
		A[j][i] = A[i][j]

C = np.zeros((2 * n, 2 * n + 1))
for i in range(2 * n):
	for j in range(2 * n):
		C[i][j] = A[i][j]
	C[i][2 * n] = b[i]

rankA = np.linalg.matrix_rank(A)
rankAb = np.linalg.matrix_rank(C)

if rankA == rankAb:
	print('Yes')
else:
	print('No')