#include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <cstdlib>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;

int main() {
	long long N, L; cin >> N >> L;
	vector<long long> d(2 * N);
	for (int i = 0; i < N; i++) cin >> d[i];
	for (int i = 0; i < N; i++) d[N + i] = L + d[i];
	vector<long long> B(2 * N);
	for (int i = 0; i < 2 * N; i++) cin >> B[i];

	bool flag = true;
	vector<long long> num(N, 0);
	for (int i = 0; i < N; i++) {
		if ((B[i + 1] - B[i]) % (d[i + 1] - d[i]) != 0) {
			flag = false;
			break;
		}
		else num[i] = (B[i + 1] - B[i]) / (d[i + 1] - d[i]);
		if (B[i + 1] - B[i] != B[N + i] - B[(N + i + 1) % (2 * N)]) {
			flag = false;
			break;
		}
	}

	vector<long long> ans(N, 0);
	for (int i = 0; i < N; i++) {
		if (i == 0) {
			if ((num[0] + num[N - 1]) % 2 == 1) flag = false;
			if (!flag) break;
			ans[0] = (num[0] + num[N - 1]) / 2;
		}
		else {
			if ((num[i] - num[i - 1]) % 2 == 1) flag = false;
			if (!flag) break;
			ans[i] = (num[i] - num[i - 1]) / 2;
		}
	}

	if (!flag) cout << "No" << endl;
	else {
		for (int i = 0; i < N; i++) {
			if (ans[i] > 0) {
				for (int j = 0; j < i; j++) {
					B[j] -= ans[i] * (d[i] - d[j]);
				}
				for (int j = i; j < N + i; j++) {
					B[j] -= ans[i] * (d[j] - d[i]);
				}
				for (int j = N + i; j < 2 * N; j++) {
					B[j] -= ans[i] * (2 * L - d[j] + d[i]);
				}
			}
			if (ans[i] < 0) {
				int i_ = i + N;
				ans[i] = 0 - ans[i];
				for (int j = 0; j < i_ - N; j++) {
					B[j] -= ans[i] * (2 * L + d[j] - d[i_]);
				}
				for (int j = i_ - N; j < i_; j++) {
					B[j] -= ans[i] * (d[i_] - d[j]);
				}
				for (int j = i_; j < 2 * N; j++) {
					B[j] -= ans[i] * (d[j] - d[i_]);
				}
			}
		}
		for (int i = 0; i < 2 * N; i++) {
			if (B[i] != B[(i + 1) % (2 * N)]) flag = false;
		}
		if (B[0] < 0 || B[0] % L != 0) flag = false;

		if (flag) cout << "Yes" << endl;
		else cout << "No" << endl;
	}
}